A simple linear time algorithm for cograph recognition

Discrete Applied Mathematics

Volumn 145, Issue 2, 2005, Pages 183-197

  Habib, Michel ^a   Paul, Christophe ^a  

^a CNRS   (France)

Author keywords

Algorithms; Graphs; Modular decomposition

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA STRUCTURES; MATHEMATICAL OPERATORS; PROBLEM SOLVING; SET THEORY;

COGRAPHS; DECOMPOSITION TREE; MODULAR DECOMPOSITION; PERMUTATION;

GRAPH THEORY;

EID: 8344242112     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.01.011     Document Type: Article

References (21)

1. A. Bretscher, D.G. Cornell, M. Habib, C. Paul, A simple linear time lexbfs cograph recognition algorithm, in: Graph-Theoretic Concepts in Computer Science - WG'03, number 2880 in Lecture Notes in Computer Science, 2003, pp. 119-130.
2. C. Capelle, Decomposition de graphes et permutations factorisantes, Ph.D. Thesis, Univ. de Montpellier II, 1997.
3. C. Capelle, M. Habib, F. de Montgolfier, Graph decompositions and factorizing permutations, Discrete Math. Theoret. Comput. Sci. 5 (1) (2002) 55-70.
4. D.G. Corneil, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Comput. 14 (4) (1985) 926-934.
5. A. Cournier, M. Habib, A new linear algorithm for modular decomposition, in: S. Tison (Ed.), 19th International ColloquiumTrees in Algebra and Programming, CAAP'94, Vol. 787, Lecture notes in Computer Science, Springer, Berlin, 1994, pp. 68-82.
6. E. Dahlhaus, Efficient parallel algorithms of cographs and distance hereditary graphs, Discrete Appl. Math. 57 (1995) 29-54.
7. E. Dahlhaus, J. Gustedt, R.M. McConnell, Efficient and practical algorithms for sequential modular decomposition, J. Algorithms 41 (2) (2001) 360-387.
8. G. Damiand, M. Habib, C. Paul, A simple paradigm for graph recognition: application to cographs and distance hereditary graphs, Theoret. Comput. Sci. 263 (2001) 99-111.
9. T. Gallai, Transitiv orientierbarer graphen. Acta Math. Acad. Sci. Hung. 18 (1967) 25-66.
10. M. Habib, R. McConnell, C. Paul, L. Viennot, Lex-bfs and partition refinement, with, applications to transitive orientation, interval graph recognition and consecutive ones testing, Theoret. Comput. Sci. 234 (2000) 59-84.
11. M. Habib, C. Paul, L. Viennot, Partition refinement techniques an interesting algorithmic tool kit, Internet J. Found. Comput. Sci. 10 (2) (1999) 147-170.
12. M. Habib, C. Paul, L. Viennot, Linear time recognition of p4-indifference graphs, Discrete Math. Theoret. Comput. Sci. 4 (2) (2001) 173-178.
13. C.T. Hoàng, Perfect graphs, Ph.D. Thesis, School of Computer Science, McGill University, Montréal, 1985.
14. Hsu, W.L., Ma, T.Z., Substitution decomposition on chordal graphs and applications, in: Proceedings of the 2ndACM-SIGSAM International Symposium on Symbolic and Algebraic Computation, number 557 in Lecture Notes in Computer Science, Springer; Berlin, 1991.
15. B. Jamison, S. Olariu, A new class of brittle graphs, Stud. Appl. Math. 81 (1989) 89-92.
16. B. Jamison, S. Olariu, p4-reducible graphs - a class of uniquely representable graphs, Stud. Appl. Math. 81 (1989) 79-87.
17. B. Jamison, S. Olariu, A unique tree representation of p4-spscse graphs, Discrete Appl. Math. 35 (1992) 115-129.
18. R.M. McConnell, J.P. Spinrad, Linear-time modular decomposition and efficient transitive orientation of comparability graphs, in: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms Arlington, VA, ACM, New York, 1994, pp. 536-545.
19. R. Paige, R.E. Tarjan, Three partition refinement algorithms, SIAM J. Comput. 16 (6) (1987) 973-989.
20. V. Raghavan, J. Spinrad, Robust algorithms for restricted domains, in: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, Vol. 2, 2001, pp. 460-467
21. S. Seinsche, On a property of the class of n-colorable graphs, J. Combin. Theory (B) (1974) 191-193.