On the probable behaviour of some algorithms for finding the stability number of a graph
- 1 November 1982
- journal article
- Published by Cambridge University Press (CUP) in Mathematical Proceedings of the Cambridge Philosophical Society
- Vol. 92 (3) , 511-526
- https://doi.org/10.1017/s0305004100060205
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- The Worst and the Most Probable Performance of a Class of Set-Covering AlgorithmsSIAM Journal on Computing, 1983
- Determining the Chromatic Number of a GraphSIAM Journal on Computing, 1979
- Determining the Stability Number of a GraphSIAM Journal on Computing, 1977
- Finding a Maximum Independent SetSIAM Journal on Computing, 1977
- Cliques in random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1976
- On colouring random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1975