Open AccessOptimal and Random Partitions of Random Graphs
Author(s) -
Joseph L. Ganley
Publication year - 1994
Publication title -
the computer journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/37.7.641
Subject(s) - random graph , combinatorics , random regular graph , partition (number theory) , mathematics , frequency partition of a graph , graph , discrete mathematics , line graph , pathwidth , graph power
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom