Publication:2712576
From MaRDI portal
DOI<116::AID-RSA1001>3.0.CO;2-2 10.1002/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2zbMath0972.68129MaRDI QIDQ2712576
Publication date: 6 November 2001
68R10: Graph theory (including graph drawing) in computer science
Related Items
A Spectral Method for MAX2SAT in the Planted Solution Model, A reductive approach to hypergraph clustering: an application to image segmentation
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Some simplified NP-complete graph problems
- The Metropolis algorithm for graph bisection
- The solution of some random NP-hard problems in polynomial expected time
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- An Efficient Heuristic Procedure for Partitioning Graphs
- Genetic algorithm and graph partitioning