Skip to Main content Skip to Navigation
Journal articles

Linear-time modular decomposition of directed graphs

Abstract : Modular decomposition of graphs is a powerful tool with many applications in graph theory and optimization. There are efficient linear-time algorithms that compute the decomposition for undirected graphs. The best previously published time bound for directed graphs is O(n + m log n), where n is the number of vertices and m is the number of edges. We give an O(n+m)-time algorithm.
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-00159571
Contributor : Fabien de Montgolfier Connect in order to contact the contributor
Submitted on : Tuesday, July 3, 2007 - 3:29:51 PM
Last modification on : Saturday, November 20, 2021 - 3:49:42 AM
Long-term archiving on: : Monday, June 27, 2011 - 4:37:26 PM

Files

DAM.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00159571, version 1

Collections

Citation

Ross Mcconnell, Fabien de Montgolfier. Linear-time modular decomposition of directed graphs. Discrete Applied Mathematics, Elsevier, 2005, 145 (2), pp.189-209. ⟨hal-00159571⟩

Share

Metrics

Record views

270

Files downloads

410