Optimal and Random Partitions of Random Graphs

Simple item page
dc.contributor.authorHeath, Lenwood S.en
dc.contributor.authorLavinus, Joseph W.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:41Zen
dc.date.available2013-06-19T14:36:41Zen
dc.date.issued1993-07-01en
dc.description.abstractThe 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.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000366/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000366/01/TR-93-24.pdfen
dc.identifier.trnumberTR-93-24en
dc.identifier.urihttp://hdl.handle.net/10919/19839en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleOptimal and Random Partitions of Random Graphsen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR-93-24.pdf
Size:
302.69 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports