Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
- 1 September 1982
- journal article
- Published by Springer Nature in Computing
- Vol. 28 (3) , 257-267
- https://doi.org/10.1007/bf02241753
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- A probabilistic model for the analysis of the routing process for circuitsNetworks, 1980
- Randomly matchable graphsJournal of Graph Theory, 1979
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- The Bottleneck Traveling Salesman ProblemJournal of the ACM, 1978
- A probabilistic minimum spanning tree algorithmInformation Processing Letters, 1978
- A Survey of Analysis Techniques for Discrete AlgorithmsACM Computing Surveys, 1977
- Cliques in random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1976
- On Hamilton-cycles of random graphsPeriodica Mathematica Hungarica, 1971
- Asymptotics and random matrices with row-sum and column sum-restrictionsBulletin of the American Mathematical Society, 1969
- On the existence of a factor of degree one of a connected random graphActa Mathematica Hungarica, 1966