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

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

Volumn 2420, Issue , 2002, Pages 305-318

  Hajiaghayi, Mohammad Taghi ^a   Nishimura, Naomi ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; SET THEORY;

BOUNDED DEGREE; BOUNDED TREEWIDTH; CONNECTED COMPONENT; N-VERTEX GRAPH; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; SUBGRAPH ISOMORPHISM; SUBGRAPH ISOMORPHISM PROBLEM;

GRAPH THEORY;

EID: 84956996844     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45687-2_25     Document Type: Conference Paper

References (21)

1. Stefan Arnborg, Jens Lagergren, and Detlef Seese. Problems easy for treedecomposable graphs (extended abstract). In Proc., 15th Internat. Colloquium on Automata, Languages, and Programming, pages 38-51, 1998.
2. Stefan Arnborg and Andrzej Proskurowski. Characterization and recognition of partial 3-trees. SIAMJ. Algebraic Discrete Methods, 7(2):305-314, 1986.
3. Stefan Arnborg and Andrzej Proskurowski. Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math., 23(1):11-24, 1989.
4. Hans L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAMJ. Comput., 25(6):1305-1317, 1996.
5. Hans L. Bodlaender. Treewidth: algorithmic techniques and results. In Proc., 22nd Internat. Symposium on Mathematical Foundations of Computer Science, pages 29-36, 1997.
6. Hans L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci., 209(1-2):1-45, 1998.
7. John A. Bondy and U. S. R. Murty. Graph Theory with Applications. American Elsevier Publishing Co., Inc., New York, 1976.
8. Franz J. Brandenburg. Pattern matching problems in graphs. Manuscript, 2001.
9. Anders Dessmark, Andrzej Lingas, and Andrzej Proskurowski. Faster algorithms for subgraph isomorphism of k-connected partial k-trees. Algorithmica, 27(3-4):337-347, 2000.
10. Anders Dessmark, Andrzej Lingas, and Andrzej Proskurowski. Maximum packing for k-connected partial k-trees in polynomial time. Theoret. Comput. Sci., 236(1-2):179-191, 2000.
11. David Eppstein. Subgraph isomorphism in planar graphs and related problems. Journal of Graph Algorithms and Applications, 3(3):27 pp. (electronic), 1999.
12. David Eppstein. Diameter and treewidth in minor-closed graph families. Algorithmica, 27(3-4):275-291, 2000.
13. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman and Co., San Francisco, Calif., 1979.
14. Arvind Gupta and Naomi Nishimura. The complexity of subgraph isomorphism for classes of partial k-trees. Theoret. Comput. Sci., 164(1-2):287-298, 1996.
15. Arvind Gupta and Naomi Nishmura. Sequential and parallel algorithms for embedding problems on classes of partial k-trees. In Proc., 4th Scandinavian Workshop on Algorithm Theory, pages 172-182, 1994.
16. Mohammad Taghi Hajiaghayi. Algorithms for Graphs of (Locally) Bounded Treewidth. Master’s thesis, University of Waterloo, September 2001. http://citeseer.nj.nec.com/hajiaghayi01algorithms.html.
17. Jan van Leeuwen. Graph algorithms. In Handbook of Theoretical Computer Science, Vol. A, pages 525-631. Elsevier, Amsterdam, 1990.
18. Jiří Matoušek and Robin Thomas. On the complexity of finding iso-and other morphisms for partial k-trees. Discrete Math., 108(1-3):343-364, 1992.
19. Neil Robertson and Paul D. Seymour. Graph minors II. Algorithmic aspects of tree-width. J. Algorithms, 7(3):309-322, 1986.
20. Daniel P. Sanders. On linear recognition of tree-width at most four. SIAMJ. Discrete Math., 9(1):101-117, 1996.
21. Maciej M. SysGlo. The subgraph isomorphism problem for outerplanar graphs. Theoret. Comput. Sci., 17(1):91-97, 1982.