A general algorithmic scheme for modular decompositions of hypergraphs and applications

DOI10.1007/978-3-030-25005-8_21MaRDI QIDQ2301749zbMATH OpenOpenAlexFDO

Authors Fabien De Montgolfier, Lalla Mouatadid, Mengchuan Zou, M. A. Habib

Publication date 25 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-25005-8_21

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Recommendations

• A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs
• An Algorithm for the Modular Decomposition of Hypergraphs
• Modular decomposition of hypergraphs
• Algorithmic aspects of a general modular decomposition theory
• Modular decomposition and transitive orientation

Cited in

(8)

• Algorithmic aspects of a general modular decomposition theory
• From modular decomposition trees to rooted median graphs
• 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
• An Algorithm for the Modular Decomposition of Hypergraphs
• Modular decomposition of hypergraphs
• Computing well-covered vector spaces of graphs using modular decomposition

This page was built for publication: A general algorithmic scheme for modular decompositions of hypergraphs and applications

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