Max Cut for Random Graphs with a Planted Partition.
Béla BollobásAlex D. ScottPublished in: Comb. Probab. Comput. (2004)
Keyphrases
- random graphs
- max cut
- phase transition
- np complete problems
- graph theoretic
- graph model
- planar graphs
- graph partitioning
- np hard
- constraint satisfaction
- np complete
- satisfiability problem
- spectral graph
- normalized cut
- small world
- graph coloring
- undirected graph
- pairwise similarities
- hard problems
- combinatorial problems
- power law
- similarity measure
- tree structure
- constraint satisfaction problems
- pairwise
- search algorithm