Skip to main content
SpringerLink
Log in

Embeddings of k-Connected Graphs of Pathwidth k

  • Conference paper
  • First Online:
Algorithm Theory - SWAT 2000 (SWAT 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1851))

Included in the following conference series:

Abstract

We present O( n 3) embedding algorithms (generalizing subgraph isomorphism) for classes of graphs of bounded pathwidth, where n is the number of vertices in the graph. These include the first polynomialtime algorithm for minor containment and the first O( n c) algorithm (c a constant independent of k) for topological embedding of graphs from subclasses of partial k-trees. Of independent interest are structural properties of k-connected graphs of bounded pathwidth on which our algorithms are based. We also describe special cases which reduce to various generalizations of string matching, permitting more efficient solutions.

Research supported by the Natural Sciences and Engineering Research Council of Canada and Communications and Information Technology Ontario.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Google Scholar 

  2. J. A. Bondy and U.S.R. Murty. Graph Theory with Applications. North-Holland, 1976.

    Google Scholar 

  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.

    Google Scholar 

  4. R. G. Downey and M. R. Fellows. Fixed-parameter tractability and completeness. I. Basic results. SIAM Journal on Computing, 24(4):873–921,August 1995.

    Article  MATH  MathSciNet  Google Scholar 

  5. A. Dessmark, A. Lingas, and A. Proskurowski. Faster algorithms for subgraph isomorphism of k-connected partial k-trees. In Proceedings of the Fourth Annual European Symposium on Algorithms, pages 501–513, 1996. To appear, Algorithmica.

    Google Scholar 

  6. A. Gupta and N. Nishimura. Sequential and parallel algorithms for embedding problems on classes of partial k-trees. In Proceedings of the Fourth Scandinavian Workshop on Algorithm Theory, pages 172–182, 1994.

    Google Scholar 

  7. A. Gupta and N. Nishimura. The parallel complexity of tree embedding problems. Journal of Algorithms, 18(1):176–200, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  8. A. Gupta and N. Nishimura. The complexity of subgraph isomorphism for classes of partial k-trees. Theoretical Computer Science, 164:287–298, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  9. A. Gupta and N. Nishimura. Topological embedding of k-connected partial k-trees. submitted, 1998.

    Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  11. J. Matoujsek and R. Thomas. On the complexity of finding iso-and other morphisms for partial k-trees. Discrete Mathematics, 108:343–364, 1992.

    Article  MathSciNet  Google Scholar 

  12. A. Proskurowski. Separating subgraphs in k-trees: cables and caterpillars. Discrete Mathematics, 49:275–285, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  15. M. M. Syslo. The subgraph isomorphism problem for outerplanar graphs. Theoretical Computer Science, 17:91–97, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  16. A. Takahashi, S. Ueno, and Y. Kajitani. Mixed searching and proper-pathwidth. Theoretical Computer Science, 137(2):253–268, January 1995.

    Article  MATH  MathSciNet  Google Scholar 

  17. J. van Leeuwen. Handbook of Theoretical Computer Science A: Algorithms and Complexity Theory, chapter Graph algorithms. North-Holland, Amsterdam, 1990.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing Science, Simon Fraser University, Burnaby B.C, Canada

    Arvind Gupta

  2. Department of Computer Science, University of Waterloo, Waterloo, Ontario

    Naomi Nishimura & Prabhakar Ragde

  3. Department of Computer Science, University of Oregon, Eugene, Oregon, USA

    Andrzej Proskurowski

Authors
  1. Arvind Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Naomi Nishimura
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrzej Proskurowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Prabhakar Ragde
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gupta, A., Nishimura, N., Proskurowski, A., Ragde, P. (2000). Embeddings of k-Connected Graphs of Pathwidth k. In: Algorithm Theory - SWAT 2000. SWAT 2000. Lecture Notes in Computer Science, vol 1851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44985-X_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-44985-X_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67690-4

  • Online ISBN: 978-3-540-44985-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation