Large Cliques Elude the Metropolis Process
- 1 January 1992
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 3 (4) , 347-359
- https://doi.org/10.1002/rsa.3240030402
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- The effect of the density of states on the Metropolis algorithmInformation Processing Letters, 1991
- The solution of some random NP-hard problems in polynomial expected timeJournal of Algorithms, 1989
- Graphs with small chromatic numbers are easy to colorInformation Processing Letters, 1989
- The time complexity of maximum matching by simulated annealingJournal of the ACM, 1988
- Almost all k-colorable graphs are easy to colorJournal of Algorithms, 1988
- Colouring random graphsAnnals of Operations Research, 1984
- Optimization by Simulated AnnealingScience, 1983
- On the probable behaviour of some algorithms for finding the stability number of a graphMathematical Proceedings of the Cambridge Philosophical Society, 1982
- Cliques in random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1976
- On colouring random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1975