A Representation Theorem for Union-Difference Families and Application

DOI10.1007/978-3-540-78773-0_43zbMATH Open1136.68444OpenAlexW1508882751MaRDI QIDQ5458554FDOQ5458554

Author name not available (Why is that?)

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)

Cites Work

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

Cited In (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

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

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