A Representation Theorem for Union-Difference Families and Application

DOI10.1007/978-3-540-78773-0_43MaRDI QIDQ5458554zbMATH OpenOpenAlexFDO

Authors

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)

Recommendations

• Tree-representation of set families and applications to combinatorial decompositions
• A generic approach to decomposition algorithms, with an application to digraph decomposition
• Unifying the representation of symmetric crossing families and weakly partitive families
• scientific article; zbMATH DE number 437545
• Unifying Two Graph Decompositions with Modular Decomposition

Cites work

• scientific article; zbMATH DE number 3906240 (Why is no real title available?)
• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• scientific article; zbMATH DE number 1478125 (Why is no real title available?)
• scientific article; zbMATH DE number 1865935 (Why is no real title available?)
• A Combinatorial Decomposition Theory
• A complete complexity classification of the role assignment problem
• Centroids, Representations, and Submodular Flows
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Decomposition of Directed Graphs
• Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
• PC trees and circular-ones arrangements.
• Partition refinement techniques: an interesting algorithmic tool kit
• Partitive hypergraphs
• Regular equivalence: General theory
• The bi-join decomposition
• Transitiv orientierbare Graphen

Cited in

(6)

• A generic approach to decomposition algorithms, with an application to digraph decomposition
• Tree-representation of set families and applications to combinatorial decompositions
• Graph-Theoretic Concepts in Computer Science
• Unifying the representation of symmetric crossing families and weakly partitive families
• Canonical forests in directed families
• A survey of the algorithmic aspects of modular decomposition

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)