The bi-join decomposition
From MaRDI portal
Publication:3439330
DOI10.1016/j.endm.2005.06.039zbMath1200.05168OpenAlexW1996198939MaRDI QIDQ3439330
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
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
Tree-representation of set families and applications to combinatorial decompositions ⋮ Switching to Hedgehog-Free Graphs Is NP-Complete ⋮ The behavior of clique-width under graph operations and graph transformations ⋮ On Switching to H‐Free Graphs ⋮ Clique-width of graphs defined by one-vertex extensions ⋮ A Representation Theorem for Union-Difference Families and Application
Cites Work
- Completely separable graphs
- Distance-hereditary graphs
- Complement reducible graphs
- Modular decomposition and transitive orientation
- Decomposition of Directed Graphs
- Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
- Unnamed Item
- Unnamed Item
This page was built for publication: The bi-join decomposition