Abstract
This paper introduces a new simple linear time algorithm to recognize cographs (graphs without an induced P 4). Unlike other cograph recognition algorithms, the new algorithm uses a multisweep Lexicographic Breadth First Search (LexBFS) approach, and introduces a new variant of LexBFS, called LexBFS−, operating on the complement of the given graph G and breaking ties with respect to an initial LexBFS. The algorithm either produces the cotree of G or identifies an induced P 4.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chang, J.-M., Ho, C.-W., Ko, M.-T.: LexBFS-ordering in Asteroidal Triple-free Graphs. In: Aggarwal, A.K., Pandu Rangan, C. (eds.) ISAAC 1999. LNCS, vol. 1741, pp. 163–172. Springer, Heidelberg (1999)
Corneil, D.G.: A Simple 3-sweep LBFS Algorithm for the Recognition of Unit Interval Graphs. Discrete AppliedMathematics (to appear)
Corneil, D.G., Olariu, S., Stewart, L.K.: The Ultimate Interval Graph Recognition Algorithm (Extended Abstract). In: Symposium on Discrete Algorithms, pp. 175–180 (1998)
Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement Reducible Graphs. Discrete Applied Math. 3(1), 63–174 (1981)
Corneil, D.G., Pearl, Y., Stewart, L.: A linear recognition algorithm for cographs. SIAM Journal of Computing 14(4), 926–934 (1985)
Cournier, A., Habib, M.: A new linear algorithm for modular decomposition. In: Tison, S. (ed.) CAAP 1994. LNCS, vol. 787, pp. 68–84. Springer, Heidelberg (1994)
Dahlhaus, E.: Efficient parallel recognition algorithms for cographs andd istance hereditary graphs. Discrete Applied Mathematics 57, 29–45 (1995)
Dahlhaus, E., Gustedt, J., McConnell, R.M.: Efficient andpractical modular decomposition. In: 8th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA), pp. 26–35 (1997)
Habib, M., Paul, C.: A new vertex splitting algorithm for cograph recognition. Technical Report (April 2000), http://citeseer.nj.nec.com/habib00new.html
Habib, M., McConnell, R.M., Paul, C., Viennot, L.: Lex-BFS and Partition Refinement, with Applications to Transitive Orientation, Interval Graph Recognition and Consecutive Ones Testing. Theoretical Computer Science 234, 59–84 (2000)
Korte, N., Möhring, H.: An incremental linear-time algorithm for recognizing interval graphs. SIAM J. Comput. 18, 68–81 (1989)
McConnell, R.M., Spinrad, J.: Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs. In: Proceedings of the ACMSIAM Symposium on Discrete Algorithms, pp. 536–545 (1994)
Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5, 266–283 (1976)
Shew, S.: A Cograph Approach to Examination Scheduling. M.Sc Thesis, Dept. of Computer Science, University of Toronto (1986)
West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddler River (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bretscher, A., Corneil, D., Habib, M., Paul, C. (2003). A Simple Linear Time LexBFS Cograph Recognition Algorithm. In: Bodlaender, H.L. (eds) Graph-Theoretic Concepts in Computer Science. WG 2003. Lecture Notes in Computer Science, vol 2880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39890-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-39890-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20452-7
Online ISBN: 978-3-540-39890-5
eBook Packages: Springer Book Archive