GRAPH BISECTION ALGORITHMS WITH GOOD AVERAGE CASE BEHAVIOR.

Thang Bui, Soma Chaudhuri, Tom Leighton, Mike Sipser

Research output: Chapter in Book/Report/Conference proceedingConference contribution

23 Scopus citations

Abstract

A polynomial-time algorithm is described that, for every input graph, either outputs the minimum bisection of the graph or halts without output. It is shown that the algorithm chooses the former course with high probability for many natural classes of graphs. Experimental data for over 100 graphs are presented.

Original languageEnglish (US)
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherIEEE
Pages181-192
Number of pages12
ISBN (Print)081860591X
StatePublished - Dec 1 1984

Publication series

NameAnnual Symposium on Foundations of Computer Science (Proceedings)
ISSN (Print)0272-5428

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'GRAPH BISECTION ALGORITHMS WITH GOOD AVERAGE CASE BEHAVIOR.'. Together they form a unique fingerprint.

  • Cite this

    Bui, T., Chaudhuri, S., Leighton, T., & Sipser, M. (1984). GRAPH BISECTION ALGORITHMS WITH GOOD AVERAGE CASE BEHAVIOR. In Annual Symposium on Foundations of Computer Science (Proceedings) (pp. 181-192). (Annual Symposium on Foundations of Computer Science (Proceedings)). IEEE.