Skip to Main content Skip to Navigation
New interface
Conference papers

A Simple Linear Time LexBFS Cograph Recognition Algorithm

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
Contributor : Christine Carvalho De Matos Connect in order to contact the contributor
Submitted on : Thursday, April 3, 2008 - 8:21:42 AM
Last modification on : Wednesday, October 12, 2022 - 3:59:52 AM

Links full text





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⟩



Record views