The bi-join decomposition

DOI10.1016/J.ENDM.2005.06.039MaRDI QIDQ3439330zbMATH OpenOpenAlexFDO

Authors Fabien De Montgolfier, Michaël Rao

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2005.06.039

zbMATH Keywords

decompositiongraph classesmodular decomposition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Cites work

• Complement reducible graphs
• Completely separable graphs
• Decomposition of Directed Graphs
• Distance-hereditary graphs
• scientific article; zbMATH DE number 3906240 (Why is no real title available?)
• scientific article; zbMATH DE number 1456953 (Why is no real title available?)
• Modular decomposition and transitive orientation
• Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition

Cited in

(7)

• Switching to hedgehog-free graphs is NP-complete
• Join decomposition based on fragmented column indices
• Tree-representation of set families and applications to combinatorial decompositions
• The behavior of clique-width under graph operations and graph transformations
• On Switching to H‐Free Graphs
• A Representation Theorem for Union-Difference Families and Application
• Clique-width of graphs defined by one-vertex extensions

This page was built for publication: The bi-join decomposition

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