A simple linear time algorithm for cograph recognition
Authors:
- Michel HabibMHMichel Habib
- Christophe PaulCPChristophe Paul
- 15 January 2005
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 145 (2) , 183-197
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A new linear algorithm for Modular Decomposition2005
- A Simple Linear Time LexBFS Cograph Recognition Algorithm2003
- Graph decompositions and factorizing permutations2002
- Efficient and Practical Algorithms for Sequential Modular DecompositionJournal of Algorithms, 2001
- A simple paradigm for graph recognition: application to cographs and distance hereditary graphsTheoretical Computer Science, 2001
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testingTheoretical Computer Science, 2000
- PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KITInternational Journal of Foundations of Computer Science, 1999
- Efficient parallel recognition algorithms of cographs and distance hereditary graphsDiscrete Applied Mathematics, 1995
- A Linear Recognition Algorithm for CographsSIAM Journal on Computing, 1985
- Transitiv orientierbare GraphenActa Mathematica Hungarica, 1967