Affiliation:
1. IBM Corporation, Department B62--Building 707, Box 390, Poughkeepsie, New York
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference10 articles.
1. {. On finding simple paths and circuits in a graph;I~ LSON, GORDON I;IEEE Trans. Circuit Theor.,1968
2. All paths through a maze;K~ OFT, D;Proc. IEEE,1967
3. Enumeration of all paths in digraphs;It~ K.R;Psychometrika,1964
Cited by
44 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献