Abstract
In this paper, we present a linear time algorithm for substitution decomposition on chordal graphs. Based on this result, we develop a linear time algorithm for transitive orientation on chordal comparability graphs. Which reduces the complexity of chordal comparability recognition from O(n2) to O(n+m). We also devise a simple linear time algorithm for interval graph recognition where no complicated data structure is involved.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. S. Booth and G. S. Lueker, “Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-tree Algorithms,” J. Comput. Syst. Sci., v. 13, 1976, pp. 335–379.
D. Coppersmith and S. Winograd, “Matrix Multiplication via Arithmetic Progressions,” Proceedings of the 19th Annual Symposium on the Theory of Computation, 1987, pp. 1–6.
D. Duffus, I. Rival, and P. Winkler, “Minimizing Setups for Cycle-free Ordered Sets,” Proc. of the American Math. Soc., v. 85, 1982, pp. 509–513.
P. C. Fishburn, Interval Orders and Interval Graphs, Wiley, New York, 1985.
F. Gavril, “The Intersection Graphs of Subtrees in Trees are Exactly the Chordal Graphs,” J. Combin. Theory B, v. 16, 1974, pp. 47–56.
M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
N. Korte and R. H. Möhring, “An Incremental Linear-Time Algorithm for Recognizing Interval Graphs,” SIAM J. Computing, v. 18, 1989, pp. 68–81.
W. L. Hsu, The Recognition and Isomorphism Problems for Circular-arc Graphs, preprint, 1989.
C. G. Lekkerkerker and J. Boland, “Representation of a Finite Graph by a Set of Intervals on the Real Line,” Fund. Math., v. 51, 1962, pp. 45–64.
J. H. Muller and J. Spinrad, “Incremental Modular Decomposition,” Journal of the ACM, v. 36, 1989, pp. 1–19.
T. H. Ma and J. Spinrad, “Cycle-free Partial Orders and Chordal Comparability Graphs,” Order, to appear.
D. J. Rose, R. E. Tarjan, and G. S. Lueker, “Algorithmic Aspects of Vertex Elimination of Graphs,” SIAM J. Comput., v. 5, 1976, pp. 266–283.
J. Spinrad, “On Comparability and Permutation Graphs,” SIAM J. Comput., v. 14, 1985, pp. 658–670.
J. Spinrad, “P4 Trees and Substitution Decomposition,” Discrete Applied Math., to appear, 1989.
R. E. Tarjan, “Amortized Computational Complexity,” SIAM J. Alg. Disc. Meth., v. 6, 1985, pp. 306–318.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hsu, WL., Ma, TH. (1991). Substitution decomposition on chordal graphs and applications. In: Hsu, WL., Lee, R.C.T. (eds) ISA'91 Algorithms. ISA 1991. Lecture Notes in Computer Science, vol 557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54945-5_49
Download citation
DOI: https://doi.org/10.1007/3-540-54945-5_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54945-1
Online ISBN: 978-3-540-46600-0
eBook Packages: Springer Book Archive