Simulated annealing for graph bisection
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Simulated annealing for graph bisectionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Large Cliques Elude the Metropolis ProcessRandom Structures & Algorithms, 1992
- The effect of the density of states on the Metropolis algorithmInformation Processing Letters, 1991
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph PartitioningOperations Research, 1989
- Approximating the PermanentSIAM Journal on Computing, 1989
- Expanding graphs and the average-case analysis of algorithms for matchings and related problemsPublished by Association for Computing Machinery (ACM) ,1989
- Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolvedPublished by Association for Computing Machinery (ACM) ,1988
- Graph bisection algorithms with good average case behaviorCombinatorica, 1987
- Optimization by Simulated AnnealingScience, 1983