Optimal and Random Partitions of Random Graphs
1993) Optimal and Random Partitions of Random Graphs. Technical Report TR-93-24, Computer Science, Virginia Polytechnic Institute and State University. (
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)|
|Deposited By:||User autouser|
|Deposited On:||05 December 2001|