论文信息 - Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time

Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time

Abstract A dynamic programming algorithm for determining whether a biconnected outerplanar graph is isomorphic to a subgraph of another biconnected outerplanar graph is presented. The algorithm runs in cubic time.

Andrzej Lingas

[1] D. Matula. Subtree Isomorphism in O(n5/2) , 1978 .

[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3] Gary L. Miller,et al. Isomorphism testing for graphs of bounded genus , 1980, STOC '80.

[4] S. Mitchell. Linear algorithms to recognize outerplanar and maximal outerplanar graphs , 1979 .

[5] Robert E. Tarjan,et al. Isomorphism of Planar Graphs , 1972, Complexity of Computer Computations.

[6] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[7] Maciej M. SysŁ. The subgraph isomorphism problem for outerplanar graphs , 1982 .

[8] Robert E. Tarjan,et al. Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[9] Robert E. Tarjan,et al. The Pebbling Problem is Complete in Polynomial Space , 1980, SIAM J. Comput..

[10] Steven W. Reyner,et al. An Analysis of a Good Algorithm for the Subtree Problem , 1977, SIAM J. Comput..

[11] Frank Harary,et al. Graph Theory , 2016 .

[12] Eugene M. Luks. Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time , 1980, FOCS.