Tree-representation of set families and applications to combinatorial decompositions
From MaRDI portal
Publication:412262
DOI10.1016/J.EJC.2011.09.032zbMATH Open1239.05130OpenAlexW2044825063MaRDI QIDQ412262FDOQ412262
Authors: Binh-Minh Bui-Xuan, Michaël Rao, Michel Habib 
Publication date: 4 May 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.032
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
- Title not available (Why is that?)
- Regular equivalence: General theory
- Graph minors. X: Obstructions to tree-decomposition
- Title not available (Why is that?)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Approximating clique-width and branch-width
- Feedback vertex set on graphs of low cliquewidth
- Title not available (Why is that?)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
- Transitiv orientierbare Graphen
- Minimizing symmetric submodular functions
- A Combinatorial Decomposition Theory
- A complete complexity classification of the role assignment problem
- Decomposition of Directed Graphs
- The bi-join decomposition
- A survey of the algorithmic aspects of modular decomposition
- Recognizing circle graphs in polynomial time
- Partitive hypergraphs
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- Title not available (Why is that?)
- PC trees and circular-ones arrangements.
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
- Branch-width and well-quasi-ordering in matroids and graphs.
- Decomposition of submodular functions
- A new planarity test
- Unifying the representation of symmetric crossing families and weakly partitive families
- A generic approach to decomposition algorithms, with an application to digraph decomposition
- Boolean-width of graphs
- Title not available (Why is that?)
- Centroids, Representations, and Submodular Flows
- A Representation Theorem for Union-Difference Families and Application
- Title not available (Why is that?)
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science
- Theory of 2-structures. II: Representation through labeled tree families
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)
