Faster algorithms for subgraph isomorphism of k-Connected partial k-Trees

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

Volumn 1136, Issue , 1996, Pages 501-513

  Dessmark, Anders ^a   Lingas, Andrzej ^a   Proskurowski, Andrzej ^b  

^a LUND UNIVERSITY   (Sweden)

^b UNIVERSITY OF OREGON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

K-CONNECTED; K-TREES; PARTIAL K-TREES; SUBGRAPH ISOMORPHISM; SUBGRAPHS; TIME BOUND;

FORESTRY;

EID: 84958060481     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61680-2_78     Document Type: Conference Paper

References (17)

1. S. Arnborg, J. Lagergren, D. Seese. Problems easy for tree-decomposable graphs. Journal of Algorithms, 12 (1991), pp. 308-340.
2. S. Arnborg, A. Proskurowski. Linear time algorithms for NP-hard problems on graphs embedded in k-trees. Discrete Applied Mathematics 23 (1989), pp. 11-24.
3. H. Bodlaender. Dynamic programming on graphs with bounded tree-width. Proc. ICALP'88, LNCS 317, pp. 105-118, Springer Verlag.
4. H. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. Proc. 33rd ACM STOC, pp. 226-234.
5. M.R. Garey, D.S. Johnson. Computers and Intractability. A Guide to the Theory of NPcompleteness. Freeman, San Francisco, 1979.
6. A. Gupta, N. Nishimura. Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees. Proc. SWAT'94, LNCS 824, pp. 172-182, Springer Verlag.
7. A. Gupta, N. Nishimura. Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. Proc. STACS'96, LNCS 1046, pp. 453-464.
8. F. Harary. Graph Theory. Addison-Wesley, Reading, Massachusetts, 1979.
9. J. Hopcroft and R. Karp. An n 5/2 algorithm for maximum matching in bipartite graphs. SIAM J.Comput. 2:4 (1973), pp. 225-231.
10. J. van Leeuwen. Graph Algorithms. Handbook of Theoretical Computer Science A, North Holland, Amsterdam 1990, pp. 527-631.
11. A. Lingas. Subgraphisomorphism for biconnected outerplanar graphs in cubic time. Theoretical Computer Science 68 (1989), pp. 295-302.
12. A. Lingas and M. Karpinski. Subtree Isomorphism and Bipartite Perfect Matching are Mutually NC Reducible. Tech. Rept. 856-CS, December 1986, Bonn University.
13. A. Lingas and M. Systo. A Polynomial Algorithm for Subgraph Isomorphism of Two-connected Series-Parallel Graphs. Proc. ICALP'88, LNCS 317, pp. 394-409, Springer Verlag.
14. 5/2). Annals of Discrete Mathematics 2 (1978), pp. 91-106.
15. J. Matoušek and R. Thomas. On the complexity of finding iso-and other morphisms for partial k-trees. Discrete Mathematics 108 (1992), pp. 343-364.
16. A. Proskurowski, M. Systo and P. Winter. Plane embeddings of 2-trees and biconnected partial 2-trees. To appear in SIAM J. on Discrete Mathematics, 1996.
17. N. Robertson and P. Seymour. Graph Minors II. Algorithmic aspects of tree-width. J. Algorithms No. 7 (1986), pp. 309-322.