Tree-representation of set families and applications to combinatorial decompositions
From MaRDI portal
(Redirected from Publication:412262)
Recommendations
- A generic approach to decomposition algorithms, with an application to digraph decomposition
- A Representation Theorem for Union-Difference Families and Application
- Unifying the representation of symmetric crossing families and weakly partitive families
- Graph-Theoretic Concepts in Computer Science
- Theory of 2-structures. II: Representation through labeled tree families
Cites work
- scientific article; zbMATH DE number 3906240 (Why is no real title available?)
- scientific article; zbMATH DE number 3735840 (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?)
- scientific article; zbMATH DE number 3311781 (Why is no real title available?)
- A Combinatorial Decomposition Theory
- A Representation Theorem for Union-Difference Families and Application
- A complete complexity classification of the role assignment problem
- A generic approach to decomposition algorithms, with an application to digraph decomposition
- A new planarity test
- A survey of the algorithmic aspects of modular decomposition
- Approximating clique-width and branch-width
- Boolean-width of graphs
- Branch-width and well-quasi-ordering in matroids and graphs.
- Centroids, Representations, and Submodular Flows
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Decomposition of Directed Graphs
- Decomposition of submodular functions
- Feedback vertex set on graphs of low cliquewidth
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
- Graph minors. X: Obstructions to tree-decomposition
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science
- Minimizing symmetric submodular functions
- PC trees and circular-ones arrangements.
- Partitive hypergraphs
- Recognizing circle graphs in polynomial time
- Regular equivalence: General theory
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The bi-join decomposition
- Theory of 2-structures. II: Representation through labeled tree families
- Transitiv orientierbare Graphen
- Unifying the representation of symmetric crossing families and weakly partitive families
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
Cited in
(10)- Canonical forests in directed families
- A Representation Theorem for Union-Difference Families and Application
- Hypergraphs with polynomial representation: introducing \(r\)-splits
- A generic approach to decomposition algorithms, with an application to digraph decomposition
- \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs
- \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms
- Algorithmic aspects of switch cographs
- Graph-Theoretic Concepts in Computer Science
- A type of algebraic structure related to sets of intervals
- A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs
This page was built for publication: Tree-representation of set families and applications to combinatorial decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412262)
