Fast probabilistic algorithms for hamiltonian circuits and matchings
Authors:
- D. AngluinDAD. Angluin
- L.G. ValiantLVL.G. Valiant
- 1 April 1979
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 18 (2) , 155-193
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- String Matching in Real TimeJournal of the ACM, 1981
- Aho, A. V. / Hopcroft, J. E. / Ullman, J. D., The Design and Analysis of Computer Algorithms. London‐Amsterdam‐Don Mills‐Sydney. Addison‐Wesley Publ. Comp. 1974 X, 470 S., $ 24,–ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1979
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- Hamiltonian circuits in random graphsDiscrete Mathematics, 1976
- On colouring random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1975
- Time bounded random access machinesJournal of Computer and System Sciences, 1973
- The complexity of theorem-proving procedures1971
- Graphs on unlabelled nodes with a given number of edgesActa Mathematica, 1971
- On the existence of a factor of degree one of a connected random graphActa Mathematica Hungarica, 1966
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965