Skip to Main content Skip to Navigation
Conference papers

A Simple Linear Time LexBFS Cograph Recognition Algorithm

Anna Bretscher 1 Derek Corneil 1 Michel Habib 2 Christophe Paul 3
1 DCS - Department of Computer Science [University of Toronto]
2 LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
3 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : This paper introduces a new simple linear time algorithm to recognize cographs (graphs without an induced P 4). Unlike other cograph recognition algorithms, the new algorithm uses a multisweep Lexicographic Breadth First Search (LexBFS) approach, and introduces a new variant of LexBFS, called LexBFS−, operating on the complement of the given graph G and breaking ties with respect to an initial LexBFS. The algorithm either produces the cotree of G or identifies an induced P 4.
Document type :
Conference papers
Complete list of metadata
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00269525
Contributor : Christine Carvalho de Matos <>
Submitted on : Thursday, April 3, 2008 - 8:21:42 AM
Last modification on : Monday, December 17, 2018 - 2:46:02 PM

Links full text

openaccess

Identifiers

Collections

CNRS | ALGCO | LIRMM | MIPS | UNIV-MONTPELLIER

Relations

Citation

Anna Bretscher, Derek Corneil, Michel Habib, Christophe Paul. A Simple Linear Time LexBFS Cograph Recognition Algorithm. WG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2003, Elspeet, Netherlands. pp.119-130, ⟨10.1007/978-3-540-39890-5_11⟩. ⟨lirmm-00269525⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

162