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

Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time

Andrzej Lingas | A. Lingas

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

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

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

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

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

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

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

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

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

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