A Pratical and Efficient Algorithm for Substitution Decomposition - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1997

A Pratical and Efficient Algorithm for Substitution Decomposition

Elias Dahlhaus
  • Function : Author
Ross M. Mcconnell
  • Function : Author

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.
No file

Dates and versions

inria-00549669 , version 1 (22-12-2010)

Identifiers

  • HAL Id : inria-00549669 , version 1

Cite

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⟩
21 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More