HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
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 Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 11:06:04 AM
Last modification on : Friday, February 4, 2022 - 3:33:41 AM
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 | INRIA2

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 Datacite

Share

Metrics

Record views

63

Files downloads

257

 

Contact                    Legal Notice                    Personal Data