Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings

@inproceedings{Angluin1977FastPA,
  title={Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings},
  author={Dana Angluin and Leslie G. Valiant},
  booktitle={STOC},
  year={1977}
}
The main purpose of this paper is to give techniques for analysing the probabilistic performance of certain kinds of algorithms, and hence to suggest some fast algorithms with provably desirable probabilistic behaviour. The particular problems we consider are: finding Hamiltonian circuits in directed graphs (DHC), finding Hamiltonian circuits in undirected graphs (UHC), and finding perfect matchings in undirected graphs (PM). We show that for each problem there is an algorithm that is extremely… CONTINUE READING
Highly Influential
This paper has highly influenced 52 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS