A Representation Theorem for Union-Difference Families and Application

DOI10.1007/978-3-540-78773-0_43zbMath1136.68444OpenAlexW1508882751MaRDI QIDQ5458554

No author found.

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_43

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Tree-representation of set families and applications to combinatorial decompositions ⋮ A survey of the algorithmic aspects of modular decomposition ⋮ Unifying the representation of symmetric crossing families and weakly partitive families

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A complete complexity classification of the role assignment problem
• Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
• Partitive hypergraphs
• PC trees and circular-ones arrangements.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• The bi-join decomposition
• A Combinatorial Decomposition Theory
• Decomposition of Directed Graphs
• Centroids, Representations, and Submodular Flows
• Regular equivalence: General theory
• PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT
• Transitiv orientierbare Graphen

This page was built for publication: A Representation Theorem for Union-Difference Families and Application