摘要: … the nondeterministic algorithm terminates on all simple graphs … point is reached, we will generate a simple path. Note that the first … algorithm produces a simple path, assuming that the …
acm.org
princeton.edu
sci-hub.se 参考文章(6)
Robert William Shirey, Implementation and analysis of efficient graph planarity testing algorithms ,(1969)
Robert E Tarjan, John E. Hopcroft, Planarity testing in V log V steps: extended abstract ifip congress. pp. 85- 90 ,(1971)
Richard C. Holt, E.M. Reingold, On the Time Required to Detect Cycles and Connectivity in Directed Graphs Cornell University. ,(1970)
Keith Paton, An algorithm for the blocks and cutnodes of a graph Communications of the ACM. ,vol. 14, pp. 468- 475 ,(1971) , 10.1145/362619.362628
G. Fisher, O. Wing, Computer Recognition and Extraction of Planar Graphs from the Incidence Matrix IEEE Transactions on Circuit Theory. ,vol. 13, pp. 154- 163 ,(1966) , 10.1109/TCT.1966.1082574
Frank Harary, Graph theory ,(1969)