Skip to Main content Skip to Navigation
Conference papers

A Pratical and Efficient Algorithm for Substitution Decomposition

Abstract : We give a simple recursive algorithm for modular decomposition of undirected graphs that runs in O(n + m alpha(m,n)) time. Previous algorithms with this bound are of theoretical use only. By adding some data structure tricks, we get a much simpler proof of an O(n+m) bound than was previously available. A key element of the algorithm is a procedure for finding a depth-first forest on the complement of a directed graph G in time proportional to the size of G.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/inria-00549669
Contributor : Jens Gustedt <>
Submitted on : Wednesday, December 22, 2010 - 12:04:46 PM
Last modification on : Monday, December 28, 2020 - 10:22:04 AM

Identifiers

  • HAL Id : inria-00549669, version 1

Citation

Elias Dahlhaus, Jens Gustedt, Ross M. Mcconnell. A Pratical and Efficient Algorithm for Substitution Decomposition. Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'97), 1997, New Orleans, United States. pp.26-35. ⟨inria-00549669⟩

Share

Metrics

Record views

53