Optimal and Random Partitions of Random Graphs

Heath, Lenwood S. and Lavinus, Joseph W. (1993) Optimal and Random Partitions of Random Graphs. Technical Report TR-93-24, Computer Science, Virginia Polytechnic Institute and State University.

Full text available as:
PDF - Requires Adobe Acrobat Reader or other PDF viewer.
TR-93-24.pdf (309959)

Abstract

The behavior of random graphs with respect to graph partitioning is considered. Conditions are identified under which random graphs cannot be partitioned well, i.e., a random partition is likely to be almost as good as an optimal partition.

Item Type:	Departmental Technical Report
Subjects:	Computer Science > Historical Collection(Till Dec 2001)
ID Code:	366
Deposited By:	User autouser
Deposited On:	05 December 2001