External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Tags

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs

Martin Fürer. An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs. In Javier Leach Albert, Burkhard Monien, Mario Rodríguez-Artalejo, editors, Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings. Volume 510 of Lecture Notes in Computer Science, pages 429-440, Springer, 1991.

Abstract

Abstract is missing.

runs on