Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1046, Issue , 1996, Pages 453-464

  Gupta, Arvind ^a   Nishimura, Naomi ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION; SET THEORY;

HARDNESS RESULT; K-CONNECTED; NP COMPLETE; NP-COMPLETENESS; POLYNOMIAL-TIME ALGORITHMS; RUNNING TIME; SUBGRAPH ISOMORPHISM; SUBGRAPH ISOMORPHISM PROBLEM;

TREES (MATHEMATICS);

EID: 38349041009     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60922-9_37     Document Type: Conference Paper

References (15)

1. [ACP89] S. ARNBORG, D. CORNEIL, and A. PROSKUROWSKI, Complexity of finding embeddings in a fc-tree, SIAM Journal of Algebraic and Discrete Methods 8 (1987), pp. 277-284.
2. [APS90] S. ARNBORG, A. PROSKUROWSKI, and D. SEESE, Monadic second order logic, tree automata, and forbidden minors, Proceedings of the 4th Workshop on Computer Science Logic (CSL 90), pp. 1-16, Lecture Notes in Computer Science 533, Springer-Verlag, 1990.
3. [Bod93] H. L. BODLAENDER, A linear time algorithm for finding tree-decompositions of small treewidth, Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, pp. 226-234, 1993.
4. [BH95] H. L. BODLAENDER and T. HAGERUP, Parallel algorithms with optimal speedup for bounded treewidth, Proceedings of the 22nd International Colloquium on Automata, Languages, and Programming, 1995.
5. [BK91] H. L. BODLAENDER and T. KLOKŚ, Better algorithms for the path-width and treewidth of graphs, Proceedings of the 18th International Colloquium on Automata, Languages, and Programming, pp. 544-555, 1991.
6. [GJ79] M. R. GAREY and D. S. JOHNSON, "Computers and Intractability: A Guide to the Theory of NP-completeness," Freeman, San Francisco, 1979.
7. [Klo94] T. KLOKS, Treewidth-Computations and approximations, Springer-Verlag, Lecture Notes in Computer Science 842, 1994.
8. [Lin89] A. LINGAS, Subgraph isomorphism for biconnected outerplanar graphs in cubic time, Theoretical Computer Science 63 (1989), pp. 295-302.
9. [LS88] A. LINGAS and M. M. SYSLO, A polynomial-time algorithm for subgraph isomorphism of two-connected series parallel graphs, Proceedings of the 15th International Colloquium on Automata, Languages, and Programming pp. 394-409, 1988.
10. [MT92] J. MATOUŠEK and R. THOMAS, On the complexity of finding iso-and other morphisms for partial fc-trees, Discrete Mathematics 108 (1992), pp. 343-364.
11. 2), Annals of Discrete Mathematics 2 (1978), pp. 91-106.
12. [Pro84] A. PROSKUROWSKI, Separating subgraphs in fc-trees: cables and caterpillars, Discrete Mathematics 49 (1984), pp. 275-285
13. [Ros74] D.J. ROSE, On simple characterization of k-trees, Discrete Mathematics 7 (1974), pp. 317-322.
14. [RS86] N. ROBERTSON and P. SEYMOUR, Graph Minors II. Algorithm aspects of tree-width, Journal of Algorithms 7 (1986), pp. 309-322.
15. [Sys82] M. M. SYSLO, The subgraph isomorphism problem for outerplanar graphs, Theoretical Computer Science 17 (1982), pp. 91-97.