Unifying the representation of symmetric crossing families and weakly partitive families

DOI10.1016/j.endm.2009.07.054zbMath1273.05233OpenAlexW1995471685MaRDI QIDQ2851484

No author found.

Publication date: 10 October 2013

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

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

zbMATH Keywords

modular decompositionlaminar familycross-free familysymmetric submodular function minimizationsymmetric crossing familyweakly partitive family

Mathematics Subject Classification ID

Trees (05C05) Symmetric functions and generalizations (05E05) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Tree-representation of set families and applications to combinatorial decompositions

Cites Work

• Unnamed Item
• Unnamed Item
• \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
• Partitive hypergraphs
• Graph minors. X: Obstructions to tree-decomposition
• Minimizing symmetric submodular functions
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Approximating clique-width and branch-width
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• A Combinatorial Decomposition Theory
• A Representation Theorem for Union-Difference Families and Application

This page was built for publication: Unifying the representation of symmetric crossing families and weakly partitive families