Isomorphism for graphs of bounded distance width

Algorithmica (New York)

Volumn 24, Issue 2, 1999, Pages 105-127

  Yamazaki, K ^a   Bodlaender, H L ^b   De Fluiter, B ^c   Thilikos, D M ^d  

^a GUNMA UNIVERSITY   (Japan)

^b UTRECHT UNIVERSITY   (Netherlands)

^c CQM BV   (Netherlands)

^d UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Distance pathwidth; Distance treewidth; Fixed parameter tractability; Graph isomorphism

Indexed keywords

EID: 0346401497     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009273     Document Type: Article

References (18)

1. H. L. Bodlaender, Some classes of graphs with bounded treewidth, Bulletin of the EATCS, 36 (1988), 116-126.
2. H. L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoret. Comput. Sci., 209 (1998), 1-45.
3. H. L. Bodlaender, Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees, J. Algorithms, 11 (1990), 631-643.
4. H. L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput., 25 (1996), 1305-1317.
5. A. Caprara, F. Malucelli, and D. Pretolani, On the minimum width layer decomposition problem. In preparation.
6. F. R. K. Chung, Labelings of graphs, in Selected Topics in Graph Theory 3 (L. W. Beineke and R. J. Wilson, eds.), Academic Press, San Diego (1988), pp. 151-168.
7. F. R. K. Chung and P. D. Seymour, Graphs with small bandwidth and cutwidth, Discrete Math., 75 (1989), 113-119.
8. C. J. Colbourn and K. S. Booth. Linear time automorphism algorithms for trees, interval graphs, and planar graphs, SIAM J. Comput., 10 (1981), 203-225.
9. G. Ding and B. Oporowski, Some results on tree decomposition of graphs, J. Graph Theory, 20(4) (1995), 481-499.
10. R. G. Downey and M. R. Fellows, Fixed-parameter tractability and completeness, I: Basic results, SIAM J. Comput., 24 (1995), 873-921.
11. R. G. Downey and M. R. Fellows, Fixed-parameter tractability and completeness, II: On completeness for W[1], Theoret. Cimput. Sci., 141 (1995), 109-131.
12. R. Halin, Tree-partitions of infinite graphs, Discrete Math., 97 (1991), 103-217.
13. L. M. Kirousis and D. M. Thilikos, The linkage of a graph, SIAM J. Comput., 25 (1996), 233-254.
14. B. Korte, L. Lovász, H. J. Prömel and A. Schrijver, eds., Paths, Flows, and VLSI-Layout, Springer-Verlag, Berlin (1990).
15. E. M. Luks, Isomorphism of graphs of bounded valence can be tested in polynomial time, J. Comput. System Sci., 25 (1982), 42-65.
16. N. Robertson and P. D. Seymour, Graph minors. X. Obstructions to tree-decomposition, J. Combin. Theory Ser. B, 52 (1991), 153-190.
17. D. Seese, Tree-partite graphs and the complexity of algorithms. Proc. Internat. Conf. on Fundamentals of Computation Theory, Lecture Notes in Computer Science, Vol. 199, Springer-Verlag, Berlin (1985), pp. 412-421.
18. L. Smithline, Bandwidth of the complete k-ary tree, Discrete Math., 142 (1995), 203-212.