The solution of some random NP-hard problems in polynomial expected time
Journal of Algorithms
Finding hidden Hamiltonian cycles
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Expected complexity of graph partitioning problems
Discrete Applied Mathematics - Special issue: Combinatorial Optimization 1992 (CO92)
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The metropolis algorithm for graph bisection
Discrete Applied Mathematics
Finding a large hidden clique in a random graph
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Hiding cliques for cryptographic security
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Finding and certifying a large hidden clique in a semirandom graph
Random Structures & 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
Heuristics for semirandom graph problems
Journal of Computer and System Sciences
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Improved Algorithms for the Random Cluster Graph Model
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
On the Hardness of Approximating Max k-Cut and Its Dual
On the Hardness of Approximating Max k-Cut and Its Dual
The regularity lemma and approximation schemes for dense problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Topics in black-box combinatorial optimization
Topics in black-box combinatorial optimization
Random MAX SAT, random MAX CUT, and their phase transitions
Random Structures & Algorithms - Isaac Newton Institute Programme “Computation, Combinatorics and Probability”: Part II
A spectral heuristic for bisecting random graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Graph partitioning via adaptive spectral techniques
Combinatorics, Probability and Computing
Boosting spectral partitioning by sampling and iteration
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Bounding the misclassification error in spectral partitioning in the planted partition model
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Reconstructing many partitions using spectral techniques
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
We give an algorithm that, with high probability, recovers a planted $k$-partition in a random graph, where edges within vertex classes occur with probability $p$ and edges between vertex classes occur with probability $r\ge p+c\sqrt{p\log n/n}$. The algorithm can handle vertex classes of different sizes and, for fixed $k$, runs in linear time. We also give variants of the algorithm for partitioning matrices and hypergraphs.