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 language||English (US)|
|Title of host publication||Annual Symposium on Foundations of Computer Science (Proceedings)|
|Number of pages||12|
|State||Published - 1984|
|Name||Annual Symposium on Foundations of Computer Science (Proceedings)|
All Science Journal Classification (ASJC) codes
- Hardware and Architecture