A Search Procedure for Hamilton Paths and Circuits

@article{Rubin1974ASP,
  title={A Search Procedure for Hamilton Paths and Circuits},
  author={Frank Rubin},
  journal={J. ACM},
  year={1974},
  volume={21},
  pages={576-580}
}
A search procedure is given which will determine whether Hamilton paths or circuits exist in a given graph, and will find one or all of them. A combined procedure is given for both directed and undirected graphs. The search consists of creating partial paths and making deductions which determine whether each partial path is a section of any Hamilton path whatever, and which direct the extension of the partial paths. 
Highly Cited
This paper has 45 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
Showing 1-10 of 28 extracted citations

An extension of the multi-path algorithm for finding hamilton cycles

Discrete Mathematics • 1992
View 3 Excerpts
Highly Influenced

Algorithmic Techniques for Solving Graph Problems on the Automata Processor

2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS) • 2016
View 1 Excerpt

Circular Pipelining: Minimizing Round-Trip Delay in Low-Duty-Cycle Wireless Networks

2014 IEEE 22nd International Conference on Network Protocols • 2014

Similar Papers

Loading similar papers…