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

Theoretical Computer Science

Volumn 263, Issue 1-2, 2001, Pages 99-111

  Damiand, Guillaume ^a   Habib, Michel ^a   Paul, Christophe ^b  

^a LIRMM   (France)

^b UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Classes of graphs; Cographs; Distance hereditary graphs; Recognition algorithms

Indexed keywords

ALGORITHMS; COMPUTATION THEORY;

DISTANCE HEREDITARY GRAPHS; GRAPH RECOGNITION;

GRAPH THEORY;

EID: 0034915507     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00234-6     Document Type: Article

References (13)

1. Distance hereditary graphs
2. The ultimate interval graph recognition algorithm?
3. A linear recognition algorithm for cographs
4. Efficient parallel recognition algorithm for cographs and distance hereditary graphs
5. Lex-bfs and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
6. Completely separable graphs
7. Linear-time modular decomposition and efficient transitive orientation of undirected graphs
8. Algorithmic aspects of vertex elimination on graphs
9. Simple linear algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergaphs