Abstract
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees; these include subgraph isomorphism and topological embedding, known to be NP-complete for general partial k-trees. As well as contributing to our understanding of the types of graphs for which these problems are tractable, this paper introduces methods for solving problems on graphs. In particular, we make use of the tree-decomposition of the graph to apply techniques used to solve problems on trees to solve problems on partial k-trees.
Research supported by the Natural Sciences and Engineering Research Council of Canada, the Center for System Sciences and the Advanced Systems Institute.
Research supported by the Natural Sciences and Engineering Research Council of Canada.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Arnborg, D. Corneil, and A. Proskurowski, “Complexity of finding embeddings in a k-tree,” SIAM Journal of Algebraic and Discrete Methods 8, pp. 277–284, 1987.
S. Arnborg, J. Lagergren, and D. Seese, “Problems easy for tree-decomposable graphs,” Journal of Algorithms 12, 2, pp. 308ff, 1991.
H. Bodlaender, “Dynamic programming on graphs with bounded treewidth,” Proceedings of the 15th International Colloquium on Automata, Languages and Programming, pp. 105–118.
H. Bodlaender, “A linear time algorithm for finding tree-decompositions of small treewidth,” Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, pp. 226–234, 1993.
H. Bodlaender, “NC-algorithms for graphs with bounded tree-width,” Technical Report RUU-CS-88-4, University of Utrecht, 1988.
H. Bodlaender, “Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-trees,” Journal of Algorithms 11, pp. 631–643, 1990.
J. Bondy, and U.S.R. Murty,Graph Theory with Applications, North-Holland, 1976.
R. Brent, “The parallel evaluation of general arithmetic expressions,” Journal of the ACM 21, 2, pp. 201–206, 1974.
N. Chandrasehkaran and S.T. Hedetniemi, “Fast parallel algorithms for tree decomposition and parsing partial k-trees,” Proceedings 26th Annual Allerton Conference on Communication, Control, and Computing, 1988.
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
P. Gibbons, R. Karp, G. Miller, and D. Soroker, “Subtree isomorphism is in random NC,” Discrete Applied Mathematics 29, pp. 35–62, 1990.
A. Gupta and N. Nishimura, “The parallel complexity of tree embedding problems,” to appear in Journal of Algorithms. A preliminary version has appeared in Proceedings of the Ninth Annual Symposium on Theoretical Aspects of Computer Science, pp. 21–32, 1992.
A. Gupta and N. Nishimura, “Sequential and parallel algorithms for embedding problems on classes of partial k-trees,” Technical Report CS-93-55, University of Waterloo, December 1993.
C. Jordan, “Sur les assemblages de lignes,” Journal Reine Angew. Math. 70, pp.185–190, 1869.
J. Lagergren, “Efficient parallel algorithms for tree-decompositions and related problems,” Proceedings of the 31st Annual IEEE Symposium on the Foundations of Computer Science, pp. 173–181, 1990.
A. Lingas, “Subgraph isomorphism for biconnected outerplanar graphs in cubic time,” Theoretical Computer Science 63, pp. 295–302, 1989.
A. Lingas and M. Karpinski, “Subtree isomorphism is NC reducible to bipartite perfect matching,” Information Processing Letters 30 pp. 27–32, 1989.
A. Lingas and M. M. Syslo, “A polynomial-time algorithm for subgraph isomorphism of two-connected series parallel graphs,” Proceedings of the 15th International Colloquium on Automata, Languages, and Programming pp. 394–409, 1988.
J. Matoušek and R. Thomas, “On the complexity of finding iso-and other morphisms for partial k-trees,” Discrete Mathematics 108, pp. 343–364, 1992.
D. Matula, “Subtree isomorphism in O(n5/2),” Annals of Discrete Mathematics 2, pp. 91–106, North-Holland, 1978.
B. Reed, “Finding approximate separators and computing tree width quickly,” Proceedings of the 24th ACM Symposium on the Theory of Computing, pp. 221–228, 1992.
D.J. Rose, “On simple characterization of k-trees,” Discrete Mathematics 7, pp. 317–322, 1974.
N. Robertson and P. Seymour, “Graph Minors III. Planar tree-width,” Journal of Combinatorial Theory (Ser. B) 36, pp. 49–64, 1984.
N. Robertson and P. Seymour, “Graph Minors II. Algorithm aspects of tree-width,” Journal of Algorithms 7, pp. 309–322, 1986.
M. M. Syslo, “The subgraph isomorphism problem for outerplanar graphs,” Theoretical Computer Science 17, pp. 91–97, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupta, A., Nishimura, N. (1994). Sequential and parallel algorithms for embedding problems on classes of partial k-trees. In: Schmidt, E.M., Skyum, S. (eds) Algorithm Theory — SWAT '94. SWAT 1994. Lecture Notes in Computer Science, vol 824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58218-5_16
Download citation
DOI: https://doi.org/10.1007/3-540-58218-5_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58218-2
Online ISBN: 978-3-540-48577-3
eBook Packages: Springer Book Archive