Advertisement

Embeddings of k-Connected Graphs of Pathwidth k

  • Arvind Gupta
  • Naomi Nishimura
  • Andrzej Proskurowski
  • Prabhakar Ragde
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1851)

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.

Keywords

Tree Decomposition Connected Subgraph Subgraph Isomorphism Path Decomposition Embedding Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. AF91.
    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. BM76.
    J. A. Bondy and U.S.R. Murty. Graph Theory with Applications. North-Holland, 1976.Google Scholar
  3. Bod93.
    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. DF95.
    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.zbMATHCrossRefMathSciNetGoogle Scholar
  5. DLP96.
    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. GN94.
    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. GN95.
    A. Gupta and N. Nishimura. The parallel complexity of tree embedding problems. Journal of Algorithms, 18(1):176–200, 1995.zbMATHCrossRefMathSciNetGoogle Scholar
  8. GN96.
    A. Gupta and N. Nishimura. The complexity of subgraph isomorphism for classes of partial k-trees. Theoretical Computer Science, 164:287–298, 1996.zbMATHCrossRefMathSciNetGoogle Scholar
  9. GN98.
    A. Gupta and N. Nishimura. Topological embedding of k-connected partial k-trees. submitted, 1998.Google Scholar
  10. KS96.
    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.zbMATHCrossRefMathSciNetGoogle Scholar
  11. MT92.
    J. Matoujsek and R. Thomas. On the complexity of finding iso-and other morphisms for partial k-trees. Discrete Mathematics, 108:343–364, 1992.CrossRefMathSciNetGoogle Scholar
  12. Pro84.
    A. Proskurowski. Separating subgraphs in k-trees: cables and caterpillars. Discrete Mathematics, 49:275–285, 1984.zbMATHCrossRefMathSciNetGoogle Scholar
  13. Pro89.
    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. PRS98.
    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.zbMATHCrossRefMathSciNetGoogle Scholar
  15. Sys82.
    M. M. Syslo. The subgraph isomorphism problem for outerplanar graphs. Theoretical Computer Science, 17:91–97, 1982.zbMATHCrossRefMathSciNetGoogle Scholar
  16. TUK95.
    A. Takahashi, S. Ueno, and Y. Kajitani. Mixed searching and proper-pathwidth. Theoretical Computer Science, 137(2):253–268, January 1995.zbMATHCrossRefMathSciNetGoogle Scholar
  17. vL90.
    J. van Leeuwen. Handbook of Theoretical Computer Science A: Algorithms and Complexity Theory, chapter Graph algorithms. North-Holland, Amsterdam, 1990.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Arvind Gupta
    • 1
  • Naomi Nishimura
    • 2
  • Andrzej Proskurowski
    • 3
  • Prabhakar Ragde
    • 2
  1. 1.School of Computing ScienceSimon Fraser UniversityBurnaby B.CCanada
  2. 2.Department of Computer ScienceUniversity of WaterlooWaterloo
  3. 3.Department of Computer ScienceUniversity of OregonOregonUSA

Personalised recommendations