Algorithms for graph partitioning on the planted partition model
- 1 March 2001
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 18 (2), 116-140
- https://doi.org/10.1002/1098-2418(200103)18:2<116::aid-rsa1001>3.0.co;2-2
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- The Metropolis algorithm for graph bisectionDiscrete Applied Mathematics, 1998
- Genetic algorithm and graph partitioningIEEE Transactions on Computers, 1996
- The solution of some random NP-hard problems in polynomial expected timeJournal of Algorithms, 1989
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph PartitioningOperations Research, 1989
- Graph bisection algorithms with good average case behaviorCombinatorica, 1987
- Optimization by Simulated AnnealingScience, 1983
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Sums of Independent Random VariablesPublished by Springer Science and Business Media LLC ,1975
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970