Efficient and Practical Algorithms for Sequential Modular Decomposition - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1999

Efficient and Practical Algorithms for Sequential Modular Decomposition

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

Abstract

A module of an undirected graph G=(V,E) is a set X of vertices that have the same set of neighbors in V \ X. The modular decomposition is a unique decomposition of the vertices into nested modules. We give a simpler approach to sequential linear-time modular decomposition.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3804.pdf (362.96 Ko) Télécharger le fichier

Dates and versions

inria-00072855 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072855 , version 1

Cite

Elias Dahlhaus, Jens Gustedt, Ross M. Mcconnell. Efficient and Practical Algorithms for Sequential Modular Decomposition. [Research Report] RR-3804, INRIA. 1999, pp.23. ⟨inria-00072855⟩
63 View
276 Download

Share

Gmail Facebook Twitter LinkedIn More