Skip to Main content Skip to Navigation
Reports

Efficient and Practical Algorithms for Sequential Modular Decomposition

Elias Dahlhaus Jens Gustedt 1 Ross M. Mcconnell
1 RESEDAS - Software Tools for Telecommunications and Distributed Systems
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Keywords : modular decomposition linear time algorithms
Document type :
Reports
Complete list of metadata
https://hal.inria.fr/inria-00072855
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 11:06:04 AM
Last modification on : Friday, February 26, 2021 - 3:28:07 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:25:20 PM

Files

Vignette du document
RR-3804.pdf

Identifiers

  • HAL Id : inria-00072855, version 1

Collections

INRIA | INRIA-RRRT | CNRS | LARA | LORIA | UNIV-LORRAINE

Citation

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

198

Files downloads

426

 

Contact                    Legal Notice                    Personal Data