An algorithm for finding hamilton cycles in random directed graphs
Author:
- 1 June 1988
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 9 (2) , 181-204
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Limit distribution for the existence of hamiltonian cycles in a random graphDiscrete Mathematics, 1983
- Clutter percolation and random graphs1980
- Matchings in random regular bipartite digraphsDiscrete Mathematics, 1980
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman ProblemSIAM Journal on Computing, 1979
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963