Characterizing and computing minimal cograph completions
Discrete Applied Mathematics
A General Label Search to investigate classical graph search algorithms
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
The LBFS Structure and Recognition of Interval Graphs
SIAM Journal on Discrete Mathematics
Encoding watermark numbers as cographs using self-inverting permutations
Proceedings of the 12th International Conference on Computer Systems and Technologies
Dominating induced matchings for p
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Survey: A survey of the algorithmic aspects of modular decomposition
Computer Science Review
Multiple encoding of a watermark number into reducible permutation graphs using cotrees
Proceedings of the 13th International Conference on Computer Systems and Technologies
| Hi-index | 0.00 |
Recently lexicographic breadth first search (LexBFS) has been shown to be a very powerful tool for the development of linear time, easily implementable recognition algorithms for various families of graphs. In this paper, we add to this work by producing a simple two LexBFS sweep algorithm to recognize the family of cographs. This algorithm extends to other related graph families such as $P_4$-reducible, $P_4$-sparse, and distance hereditary. It is an open question whether our cograph recognition algorithm can be extended to a similarly easy algorithm for modular decomposition.