A simple linear time algorithm for cograph recognition

[1]  T. Gallai.  Transitiv orientierbare Graphen , 1967 .

[2]  D. Seinsche.  On a property of the class of n-colorable graphs , 1974 .

[3]  Lorna Stewart,et al.  A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..

[4]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[5]  S. Olariu,et al.  P4‐Reducible Graphs—Class of Uniquely Tree‐Representable Graphs , 1989 .

[6]  S. Olariu,et al.  A New Class of Brittle Graphs , 1989 .

[7]  S. E. Markosyan,et al.  ω-Perfect graphs , 1990 .

[8]  Wen-Lian Hsu,et al.  Substitution Decomposition on Chordal Graphs and Applications , 1991, ISA.

[9]  Stephan Olariu,et al.  A tree representation for P4-sparse graphs , 1992, Discret. Appl. Math..

[10]  Michel Habib,et al.  A New Linear Algorithm for Modular Decomposition , 1994, CAAP.

[11]  Jeremy P. Spinrad,et al.  Linear-time modular decomposition and efficient transitive orientation of comparability graphs , 1994, SODA '94.

[12]  Elias Dahlhaus,et al.  Efficient Parallel Recognition Algorithms of Cographs and Distance Hereditary Graphs , 1995, Discret. Appl. Math..

[13]  C. Capelle.  Décompositions de graphes et permutations factorisantes , 1997 .

[14]  Michel Habib,et al.  Graph decompositions and factorizing permutations , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

[15]  M. Habib,et al.  Partition Refinement Techniques: An Interesting Algorithmic Tool Kit , 1999, Int. J. Found. Comput. Sci..

[16]  Laurent Viennot,et al.  Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing , 2000, Theor. Comput. Sci..

[17]  Michel Habib,et al.  A simple paradigm for graph recognition: application to cographs and distance hereditary graphs , 2001, Theor. Comput. Sci..

[18]  Jens Gustedt,et al.  Efficient and Practical Algorithms for Sequential Modular Decomposition , 2001, J. Algorithms.

[19]  Jeremy P. Spinrad,et al.  Robust algorithms for restricted domains , 2001, SODA '01.

[20]  Laurent Viennot,et al.  Linear time recognition of P4-indifference graphs , 2001, Discret. Math. Theor. Comput. Sci..

[21]  Michel Habib,et al.  Graph Decompositions andFactorizing Permutations , 2002, Discret. Math. Theor. Comput. Sci..

[22]  Michel Habib,et al.  A Simple Linear Time LexBFS Cograph Recognition Algorithm , 2003, WG.

[23]  A. ADoefaa,et al.  ? ? ? ? f ? ? ? ? ? , 2003 .