A simple linear time algorithm for cograph recognition
type: Item
instance of: scholarly article
title: A simple linear time algorithm for cograph recognition
zbMATH Open document ID: 1055.05107
author: Christophe Paul
author: M. A. Habib
published in: Discrete Applied Mathematics
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 2136940
zbMATH Keywords: Modular decomposition
zbMATH Keywords: Graphs
zbMATH Keywords: Algorithms
MaRDI profile type: Publication
full work available at URL: j.dam.2004.01.011
OpenAlex ID: W2171760878
Wikidata QID: Q56475004
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Q4331190
cites work: A Linear Recognition Algorithm for Cographs
cites work: Q4954442
cites work: Efficient parallel recognition algorithms of cographs and distance hereditary graphs
cites work: Efficient and practical algorithms for sequential modular decomposition
cites work: A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs
cites work: Transitiv orientierbare Graphen
cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
cites work: PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT
cites work: Linear time recognition of \(P_4\)-indifference graphs
cites work: A New Class of Brittle Graphs
cites work: P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
cites work: A tree representation for \(P_ 4\)-sparse graphs
cites work: Q3128916
cites work: Three Partition Refinement Algorithms
cites work: Robust algorithms for restricted domains
cites work: On a property of the class of n-colorable graphs
DBLP publication ID: journals/dam/HabibP05
DOI: 10.1016/J.DAM.2004.01.011
description: scientific article; zbMATH DE number 2136940