The solution of some random NP-hard problems in polynomial expected time
Journal of Algorithms
Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
A Spectral Technique for Coloring Random 3-Colorable Graphs
SIAM Journal on Computing
The metropolis algorithm for graph bisection
Discrete Applied Mathematics
Go with the winners for graph bisection
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Hill-climbing finds random planted bisections
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for graph partitioning on the planted partition model
Random Structures & Algorithms
Relations between average case complexity and approximation complexity
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Heuristics for semirandom graph problems
Journal of Computer and System Sciences
A Polylogarithmic Approximation of the Minimum Bisection
SIAM Journal on Computing
A spectral technique for random satisfiable 3CNF formulas
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Coloring Bipartite Hypergraphs
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Spectral partitioning works: planar graphs and finite element meshes
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Spectral Partitioning of Random Graphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Max Cut for Random Graphs with a Planted Partition
Combinatorics, Probability and Computing
Spectral clustering by recursive partitioning
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On the Expansion of the Giant Component in Percolated (n, d,λ) Graphs
Combinatorics, Probability and Computing
Group-Level Analysis and Visualization of Social Networks
Algorithmics of Large and Complex Networks
Graph partitioning via adaptive spectral techniques
Combinatorics, Probability and Computing
A spectral method for MAX2SAT in the planted solution model
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Finding a maximum independent set in a sparse random graph
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
An adaptive spectral heuristic for partitioning random graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
A simple message passing algorithm for graph partitioning problems
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 0.00 |
The minimum bisection problem is to partition the vertices of a graph into two classes of equal size so as to minimize the number of crossing edges. The problem is NP-hard in the worst case. In this paper we analyze a spectral heuristic for the minimum bisection problem on random graphs Gn(p,p'), which are made up as follows. Partition n vertices into two classes of equal size randomly, and then insert edges inside the two classes with probability p' and edges crossing the partition with probability p independently. If n(p'-p) ≥ c0√np'In(np') for a certain constant c0 0, then with probability 1 - 0(1) as n ← ∞ the heuristic finds a minimum bisection of Gn(p,p') along with a certificate of optimality in polynomial time. Furthermore, we observe that the structure of the set of all minimum bisections of Gn(p,p') undergoes a phase transition as n(p' - p) = Θ(√np' In n). The heuristic solves instances in the subcritical, the critical, and the supercritical phase of the phase transition optimally with probability 1-o(1). These results extend the work of Boppana [5].