Skip Navigation

The Computer Journal 1994 37(7):641-643; doi:10.1093/comjnl/37.7.641
© 1994 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Ganley, J. L.
Right arrow Articles by Heath, L. S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Optimal and Random Partitions of Random Graphs

J. L. Ganley1 * and L. S. Heath2 §

1 Department of Computer Science, University of Virginia, Charlottesville, VA 22903, USA, 2 Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, VA 24061-0106, USA

The behavior of random graphs with respect to graph partitioning is considered. It is shown that, for a random graph with n vertices and with expected degree exceeding a constant times ln n, the graph cannot be partitioned well, i.e. a random partition is likely to be almost as good as an optimal partition.

Received April 1994. revised July 1994.

* Department of Computer Science, University of Virginia, Charlottesville, VA 22903, USA

§ Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, VA 24061-0106, USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.