Embeddings of k-connected graphs of pathwidth k

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

Volumn 1851, Issue , 2000, Pages 111-124

  Gupta, Arvind ^a   Nishimura, Naomi ^b   Proskurowski, Andrzej ^c   Ragde, Prabhakar ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

^c UNIVERSITY OF OREGON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION; TOPOLOGY; TREES (MATHEMATICS);

EMBEDDING ALGORITHMS; EMBEDDINGS; K-CONNECTED GRAPHS; PARTIAL K-TREES; POLYNOMIAL-TIME ALGORITHMS; STRING MATCHING; SUBGRAPHS; TOPOLOGICAL EMBEDDING;

GRAPH THEORY;

EID: 59749102504     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44985-X     Document Type: Conference Paper

References (17)

1. A. Amir and M. Farach. Efficient 2-dimensional approximate matching of non-rectangular figures. In Proceedings of the Second Annual ACM-SIAM Symposiumon Discrete Algorithms, pages 212-223, 1991.
2. J. A. Bondy and U.S.R. Murty. Graph Theory with Applications. North-Holland, 1976.
3. H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, pages 226-234, 1993.
4. R. G. Downey and M. R. Fellows. Fixed-parameter tractability and com-pleteness. I. Basic results. SIAM Journal on Computing, 24(4):873-921, August 1995.
5. A. Dessmark, A. Lingas, and A. Proskurowski. Faster algorithms for sub-graph isomorphism of k-connected partial k-trees. In Proceedings of the Fourth Annual European Symposium on Algorithms, pages 501-513, 1996. To appear, Algorithmica.
6. A. Gupta and N. Nishimura. Sequential and parallel algorithms for embed-ding problems on classes of partial k-trees. In Proceedings of the Fourth Scandinavian Workshop on Algorithm Theory, pages 172-182, 1994.
7. A. Gupta and N. Nishimura. The parallel complexity of tree embedding problems. Journal of Algorithms, 18(1):176-200, 1995.
8. A. Gupta and N. Nishimura. The complexity of subgraph isomorphism for classes of partial k-trees. Theoretical Computer Science, 164:287-298, 1996.
9. A. Gupta and N. Nishimura. Topological embedding of k-connected partial k-trees. submitted, 1998.
10. H. Kaplan and R. Shamir. Pathwidth, bandwidth and completion problems to proper interval graphs with small cliques. SIAM Journal on Computing, 25(3):540-561, 1996.
11. J. Matoušek and R. Thomas. On the complexity of finding iso-and other morphisms for partial k-trees. Discrete Mathematics, 108:343-364, 1992.
12. A. Proskurowski. Separating subgraphs in k-trees: cables and caterpillars. Discrete Mathematics, 49:275-285, 1984.
13. A. Proskurowski. Maximal graphs of path-width k or searching a partial k-caterpillar. Technical Report UO-CIS-TR-89-17, University of Oregon, 1989.
14. A. Proskurowski, F. Ruskey, and M. Smith. Analysis of algorithms for listing equivalence classes of k-ary strings. SIAM Journal of Discrete Mathematics, 11(1):94-109, 1998.
15. M. M. Sys lo. The subgraph isomorphism problem for outerplanar graphs. Theoretical Computer Science, 17:91-97, 1982.
16. A. Takahashi, S. Ueno, and Y. Kajitani. Mixed searching and proper-path-width. Theoretical Computer Science, 137(2):253-268, January 1995.
17. J. van Leeuwen. Handbook of Theoretical Computer Science A: Algorithms and Complexity Theory, chapter Graph algorithms. North-Holland, Amster-dam, 1990.