Modular decomposition of hypergraphs

DOI10.1007/3-540-60618-1_84MaRDI QIDQ6122233zbMATH OpenFDO

Authors Paola Bonizzoni, Gianluca Della Vedova

Publication date 28 February 2024

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Hypergraphs (05C65)

Recommendations

• An Algorithm for the Modular Decomposition of Hypergraphs
• 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
• A survey of the algorithmic aspects of modular decomposition
• Algorithmic aspects of a general modular decomposition theory

Cites work

• scientific article; zbMATH DE number 1003286 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3906240 (Why is no real title available?)
• scientific article; zbMATH DE number 3908482 (Why is no real title available?)
• scientific article; zbMATH DE number 1456953 (Why is no real title available?)
• A \(k\)-structure generalization of the theory of 2-structures
• An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs
• Theory of 2-structures. II: Representation through labeled tree families

This page was built for publication: Modular decomposition of hypergraphs

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