Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth

Journal of Computer and System Sciences

Volumn 73, Issue 5, 2007, Pages 755-768

  Hajiaghayi, MohammadTaghi ^a   Nishimura, Naomi ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Locally bounded treewidth; Log bounded fragmentation; Subgraph isomorphism; Treewidth

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; NUMERICAL METHODS; PROBLEM SOLVING; SET THEORY;

LOCALLY BOUNDED TREEWIDTH; LOG BOUNDED FRAGMENTATION; SUBGRAPH ISOMORPHISMS; TREEWIDTH;

TREES (MATHEMATICS);

EID: 34247256707     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2007.01.003     Document Type: Article

References (31)

1. Arnborg S., Lagergren J., and Seese D. Easy problems for tree-decomposable graphs. J. Algorithms 12 2 (1991) 308-340
2. Arnborg S., and Proskurowski A. Characterization and recognition of partial 3-trees. SIAM J. Algebraic Discrete Methods 7 2 (1986) 305-314
3. Arnborg S., and Proskurowski A. Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math. 23 1 (1989) 11-24
4. Baker B.S. Approximation algorithms for NP-complete problems on planar graphs. J. Assoc. Comput. Mach. 41 1 (1994) 153-180
5. Bern M.W., Lawler E.L., and Wong A.L. Linear time computation of optimal subgraphs of decomposable graphs. J. Algorithms 8 (1987) 216-235
6. Bodlaender H.L. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25 6 (1996) 1305-1317
7. Hans L. Bodlaender, Treewidth: Algorithmic techniques and results, in: Proc. 22nd Internat. Symposium on Mathematical Foundations of Computer Science, 1997, pp. 29-36
8. Bodlaender H.L. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209 1-2 (1998) 1-45
9. Bondy J.A., and Murty U.S.R. Graph Theory with Applications (1976), American Elsevier Publishing Co., Inc., New York
10. Franz J. Brandenburg, Pattern matching problems in graphs, manuscript, 2001
11. Demaine E.D., Hajiaghayi M., Nishimura N., Ragde P., and Thilikos D.M. Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. J. Comput. System Sci. 42 (2002) 69-108
12. Dessmark A., Lingas A., and Proskurowski A. Faster algorithms for subgraph isomorphism of k-connected partial k-trees. Algorithmica 27 3-4 (2000) 337-347
13. Dessmark A., Lingas A., and Proskurowski A. Maximum packing for k-connected partial k-trees in polynomial time. Theoret. Comput. Sci. 236 1-2 (2000) 179-191
14. Eppstein D. Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms Appl. 3 3 (1999) 27 pp. (electronic)
15. Eppstein D. Diameter and treewidth in minor-closed graph families. Algorithmica 27 3-4 (2000) 275-291
16. Frick M., and Grohe M. Deciding first-order properties of locally tree-decomposable structures. J. Assoc. Comput. Mach. 48 (2001) 1184-1206
17. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-completeness (1979), W.H. Freeman and Co., San Francisco, CA
18. Garey M.R., Johnson D.S., and Tarjan R.E. The planar hamiltonian circuit problem is NP-complete. SIAM J. Comput. 5 6 (1976) 704-714
19. Grohe M. Local tree-width, excluded minors, and approximation algorithms. Combinatorica 23 4 (2003) 613-632
20. Gupta A., and Nishimura N. The complexity of subgraph isomorphism for classes of partial k-trees. Theoret. Comput. Sci. 164 1-2 (1996) 287-298
21. Arvind Gupta, Naomi Nishimura, Sequential and parallel algorithms for embedding problems on classes of partial k-trees, in: Proc. 4th Scandinavian Workshop on Algorithm Theory, 1994, pp. 172-182
22. Hajiaghayi M. Algorithms for Graphs of (Locally) Bounded Treewidth. Master's thesis, University of Waterloo (September 2001). http://citeseer.nj.nec.com/hajiaghayi01algorithms.html
23. Hajiaghayi M., and Hajiaghayi M. A note on the bounded fragmentation property and its applications in network reliability. European J. Combin. 24 7 (2003) 891-896
24. van Leeuwen J. Graph algorithms. Handbook of Theoretical Computer Science vol. A (1990), Elsevier, Amsterdam 525-631
25. Lingas A. Subgraph isomorphism for biconnected outerplanar graphs in cubic time. Theoret. Comput. Sci. 63 3 (1989) 295-302
26. Lingas A., and Sysło M.M. A polynomial-time algorithm for subgraph isomorphism of two-connected series-parallel graphs. Automata, Languages and Programming. Tampere, 1988 (1988), Springer, Berlin 394-409
27. Matoušek J., and Thomas R. On the complexity of finding iso- and other morphisms for partial k-trees. Discrete Math. 108 1-3 (1992) 343-364
28. 5 / 2). Algorithmic Aspects of Combinatorics. Conf., Vancouver Island, B.C., 1976. Ann. Discrete Math. vol. 2 (1978) 91-106
29. Robertson N., and Seymour P.D. Graph minors II. Algorithmic aspects of tree-width. J. Algorithms 7 3 (1986) 309-322
30. Sanders D.P. On linear recognition of tree-width at most four. SIAM J. Discrete Math. 9 1 (1996) 101-117
31. Sysło M.M. The subgraph isomorphism problem for outerplanar graphs. Theoret. Comput. Sci. 17 1 (1982) 91-97