Tree-representation of set families and applications to combinatorial decompositions
type: Item
instance of: scholarly article
title: Tree-representation of set families and applications to combinatorial decompositions
zbMATH Open document ID: 1239.05130
author: Binh-Minh Bui-Xuan
author: Michaël Rao
author: Michel Habib
published in: European Journal of Combinatorics
publication date: 2012-05-04T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6030339
zbMATH Keywords: weakly partitive crossing families
MaRDI profile type: Publication
full work available at URL: j.ejc.2011.09.032
OpenAlex ID: W2044825063
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: A Representation Theorem for Union-Difference Families and Application
cites work: Unifying the representation of symmetric crossing families and weakly partitive families
cites work: Boolean-Width of Graphs
cites work: Feedback Vertex Set on Graphs of Low Cliquewidth
cites work: \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
cites work: Partitive hypergraphs
cites work: Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
cites work: Decomposition of Directed Graphs
cites work: Decomposition of submodular functions
cites work: A Combinatorial Decomposition Theory
cites work: Q4149476
cites work: Q4492680
cites work: Theory of 2-structures. II: Representation through labeled tree families
cites work: Regular equivalence: General theory
cites work: A complete complexity classification of the role assignment problem
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Q3922697
cites work: Recognizing circle graphs in polynomial time
cites work: Centroids, Representations, and Submodular Flows
cites work: Transitiv orientierbare Graphen
cites work: Branch-width and well-quasi-ordering in matroids and graphs.
cites work: Q5592270
cites work: A survey of the algorithmic aspects of modular decomposition
cites work: A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition
cites work: PC trees and circular-ones arrangements.
cites work: Q3683903
cites work: The bi-join decomposition
cites work: Approximating clique-width and branch-width
cites work: Minimizing symmetric submodular functions
cites work: Graph minors. X: Obstructions to tree-decomposition
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Q4792088
cites work: A new planarity test
cites work: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
DOI: 10.1016/J.EJC.2011.09.032
description: scientific article; zbMATH DE number 6030339