An Algorithm for the Modular Decomposition of Hypergraphs
From MaRDI portal
Publication:4264487
DOI10.1006/jagm.1999.1016zbMath0942.68095OpenAlexW1995129514MaRDI QIDQ4264487
Gianluca Della Vedova, Paola Bonizzoni
Publication date: 21 August 2000
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a5d2fa1b79900cfe17c7b1cc46dea215ab41c34b
Graph theory (including graph drawing) in computer science (68R10) Modular lattices, complemented lattices (06C99)
Related Items (7)
The complexity of modular decomposition of Boolean functions ⋮ Resolutions of convex geometries ⋮ A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs ⋮ A monadic second-order definition of the structure of convex hypergraphs. ⋮ Prime 3-uniform hypergraphs ⋮ From modular decomposition trees to rooted median graphs ⋮ 3-uniform hypergraphs: modular decomposition and realization by tournaments
This page was built for publication: An Algorithm for the Modular Decomposition of Hypergraphs
