Abstract
Since the invention of PQ-trees by Booth and Lueker in 1976 the recognition of interval graphs has been simplified dramatically. In [7], we presented a very simple linear-time recognition algorithm based on scanning vertices arranged in a special perfect elimination ordering. Our approach is to decompose a given interval graph into uniquely representable components whose models can be obtained by considering “strictly overlapping” pairs of intervals. This method, however, does not yield an efficient on-line algorithm since it uses the perfect elimination scheme, which is hard to maintain efficiently in an on-line fashion.
Utilizing the decomposition approach and an “abstract” interval representation we are able to design an O(m+nlog n) time on-line recognition algorithm in this paper. The O(nlog n) factor comes from the fact that we need to maintain a concatenate queue to search for certain minimal interval “cuts” in the abstract representation.
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, Linear algorithms to recognize interval graphs and test for the consecutive ones property, Proc. 7th ACM Symp. Theory of Computing, (1975), 255–265.
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. 13, (1976), 335–379.
D. R. Fulkerson and O. A. Gross, Incidence Matrices and Interval Graphs, Pacific J. Math. 15, (1965), 835–855.
M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
W. L. Hsu, O(mn) Recognition and Isomorphism Algorithms for Circular-Arc Graphs, SIAM J. Comput. 24, (1995), 411–439.
W. L. Hsu and C. H. Ma, Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs, Lecture Notes in Computer Science 557, 52–60, (1991), to appear in SIAM J. Comput.
W. L. Hsu, A simple test for interval graphs, Lecture Notes in Computer Science 657, (1992), 11–16.
N. Korte and R. H. Möhring, An incremental linear time algorithm for recognizing interval graphs, SIAM J. Comput. 18, (1989), 68–81.
G. S. Lueker and K. S. Booth, Interval graph isomorphism, JACM 26, (1979), 195.
J. Spinrad, On Comparability and Permutation Graphs, SIAM J. Comput. 14 (1985), 658–670.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hsu, WL. (1996). On-line recognition of interval graphs in O(m+nlog n) time. In: Deza, M., Euler, R., Manoussakis, I. (eds) Combinatorics and Computer Science. CCS 1995. Lecture Notes in Computer Science, vol 1120. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61576-8_70
Download citation
DOI: https://doi.org/10.1007/3-540-61576-8_70
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61576-7
Online ISBN: 978-3-540-70627-4
eBook Packages: Springer Book Archive