An Algorithm for the Modular Decomposition of Hypergraphs

DOI10.1006/JAGM.1999.1016MaRDI QIDQ4264487zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

hypergraphs

Mathematics Subject Classification ID

Modular lattices, complemented lattices (06C99) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A general algorithmic scheme for modular decompositions of hypergraphs and applications
• A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs
• scientific article; zbMATH DE number 718859
• On graph decompositions modulo \(k\)
• An algebraic analysis of the graph modularity
• An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures
• scientific article; zbMATH DE number 5360708
• Algorithm Theory - SWAT 2004
• Decomposition of regular hypergraphs
• Linear-time modular decomposition of directed graphs

Cited in

(17)

• Algorithmic aspects of a general modular decomposition theory
• A monadic second-order definition of the structure of convex hypergraphs.
• Decomposition of a hypergraph by partial-edge separators
• Prime 3-uniform hypergraphs
• From modular decomposition trees to rooted median graphs
• A general algorithmic scheme for modular decompositions of hypergraphs and applications
• The complexity of modular decomposition of Boolean functions
• The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
• Resolutions of convex geometries
• A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs
• 3-uniform hypergraphs: modular decomposition and realization by tournaments
• scientific article; zbMATH DE number 5360708 (Why is no real title available?)
• Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
• Modular decomposition of hypergraphs
• Computing well-covered vector spaces of graphs using modular decomposition
• Irreducible pairings and indecomposable tournaments
• Indecomposable tournaments with minimum Slater index

This page was built for publication: An Algorithm for the Modular Decomposition of Hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4264487)