Skip to Main content Skip to Navigation
Conference papers

Simple, Linear-Time Modular Decomposition

Abstract : Modular decomposition is fundamental for many important problems in algorithmic graph-theory including transitive orientation, the recognition of several classes of graphs, and certain combinatorial optimization problems. Accordingly, there has been a drive towards a practical, linear-time algorithm for the problem. Despite considerable effort, such an algorithm has remained elusive. The linear-time algorithms to date are impractical and of mainly theoretical interest. In this paper we present the first simple, linear-time algorithm to compute the modular decomposition tree of an undirected graph.
Document type :
Conference papers
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00324557
Contributor : Christophe Paul <>
Submitted on : Thursday, September 25, 2008 - 2:09:22 PM
Last modification on : Saturday, March 28, 2020 - 2:18:52 AM

Identifiers

  • HAL Id : lirmm-00324557, version 1

Citation

Marc Tedder, Derek Corneil, Michel Habib, Christophe Paul. Simple, Linear-Time Modular Decomposition. ICALP: International Colloquium on Automata, Languages and Programming, Jul 2008, Reykjavik, Iceland. pp.634-645. ⟨lirmm-00324557⟩

Share

Metrics

Record views

489