A simple paradigm for graph recognition: application to cographs and distance hereditary graphs

Authors:
Guillaume Damiand;Michel Habib;Christophe Paul
Affiliations:
UMR CNRS-Univ. Montpellier II, Montpellier 5, France;UMR CNRS-Univ. Montpellier II, Montpellier 5, France;Univ. Bordeaux I, Talence, France
Venue:
Theoretical Computer Science
Year:
2001

Citing 7
Cited 17

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

SIAM Journal on Computing
Distance-hereditary graphs

Journal of Combinatorial Theory Series B
Completely separable graphs

Discrete Applied Mathematics - Computational combinatiorics
Efficient parallel recognition algorithms of cographs and distance hereditary graphs

Discrete Applied Mathematics
Linear-time transitive orientation

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The ultimate interval graph recognition algorithm?

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing

Theoretical Computer Science

An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs

Journal of Parallel and Distributed Computing
A simple linear time algorithm for cograph recognition

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs

The Journal of Supercomputing
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs

Theoretical Computer Science
Finding a minimum path cover of a distance-hereditary graph in polynomial time

Discrete Applied Mathematics
Equistable distance-hereditary graphs

Discrete Applied Mathematics
A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs

Computing
Laminar structure of ptolemaic graphs with applications

Discrete Applied Mathematics
A simple linear time algorithm for cograph recognition

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
A new approach to graph recognition and applications to distance-hereditary graphs

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Dynamic distance hereditary graphs using split decomposition

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
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
Delta-confluent drawings

GD'05 Proceedings of the 13th international conference on Graph Drawing
Laminar structure of ptolemaic graphs and its applications

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs

Discrete Applied Mathematics
Note: Computing maximum stable sets for distance-hereditary graphs

Discrete Optimization
On independence domination

FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	5.23

Visualization

Abstract

An easy way for graph recognition algorithms is to use a two-step process: first, compute a characteristic feature as if the graph belongs to that class; second, check whether the computed characteristic feature as if the graph belongs to that class; second, check whether the computed separating them may yield new and much more easily understood algorithms. In this paper we apply that paradigm to the cograph and distance hereditary graph recognition problems.