Three partition refinement algorithms
SIAM Journal on Computing
A tree representation for P4-sparse graphs
Discrete Applied Mathematics
Efficient parallel recognition algorithms of cographs and distance hereditary graphs
Discrete Applied Mathematics
Linear-time modular decomposition and efficient transitive orientation of comparability graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Robust algorithms for restricted domains
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs
Theoretical Computer Science
Efficient and practical algorithms for sequential modular decomposition
Journal of Algorithms
Substitution Decomposition on Chordal Graphs and Applications
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
A New Linear Algorithm for Modular Decomposition
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Edge Search Number of Cographs in Linear Time
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
A new characterization of P6-free graphs
Discrete Applied Mathematics
Read-once functions and query evaluation in probabilistic databases
Proceedings of the VLDB Endowment
Faster query answering in probabilistic databases using read-once functions
Proceedings of the 14th International Conference on Database Theory
Complexity of most vital nodes for independent set in graphs related to tree structures
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
The most vital nodes with respect to independent set and vertex cover
Discrete Applied Mathematics
Recognition of probe cographs and partitioned probe distance hereditary graphs
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
On the recognition of probe graphs of some self-complementary classes of perfect graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Roman domination over some graph classes
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Edge search number of cographs
Discrete Applied Mathematics
Bounding the number of reduced trees, cographs, and series-parallel graphs by compression
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Survey: A survey of the algorithmic aspects of modular decomposition
Computer Science Review
On the recognition of k-equistable graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Hi-index | 0.00 |
In this paper, we describe a new simple linear time algorithm to recognize cographs. Cographs are exactly the P"4-free graphs (where P"4 denotes the path with 4 vertices). The recognition process works in two steps. First, we use partition refinement techniques to produce a factorizing permutation, i.e., an ordering of the vertices in which the strong modules appear consecutively. Then a very simple test algorithm is provided to check whether the given graph is a cograph, using a single sweep of the permutation obtained in the first step.