A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs

DOI10.1016/j.tcs.2022.04.052OpenAlexW4225162735MaRDI QIDQ2672614

Lalla Mouatadid, Mengchuan Zou, Fabien de Montgolfier, Michel A. Habib

Publication date: 13 June 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.04.052

zbMATH Keywords

algorithmsorthogonalitycombinatorial decompositiongraph and hypergraph modular decompositionpartitive family

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

\(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tree-representation of set families and applications to combinatorial decompositions
• A survey of the algorithmic aspects of modular decomposition
• Into the square: on the complexity of some quadratic-time solvable problems
• A note on computing set overlap classes
• Partitive hypergraphs
• A monadic second-order definition of the structure of convex hypergraphs.
• Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
• Linear-time modular decomposition of directed graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A general algorithmic scheme for modular decompositions of hypergraphs and applications
• The complexity of modular decomposition of Boolean functions
• On the composition and decomposition of clutters
• Fast Algorithms for Finding Nearest Common Ancestors
• Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• An Algorithm for the Modular Decomposition of Hypergraphs
• Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
• PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT
• Algorithm Theory - SWAT 2004
• Clutter Decomposition and Monotonic Boolean Functions*
• Graph-Theoretic Concepts in Computer Science
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs