Hypertree-depth and minors in hypergraphs
From MaRDI portal
Publication:1929221
DOI10.1016/j.tcs.2012.09.007zbMath1253.05107MaRDI QIDQ1929221
Tomáš Gavenčiak, Isolde Adler, Tereza Klimošová
Publication date: 7 January 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.09.007
tree-depth; hypertree-width; hyperpath-width; hypertree-depth; minors in hypergraphs; robber and marshals game
Cites Work
- Graph minors. III. Planar tree-width
- Parameterized and exact computation. 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10--11, 2009. Revised selected papers
- The complexity of induced minors and related problems
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
- Graph minors. XIII: The disjoint paths problem
- Grad and classes with bounded expansion. I: Decompositions
- Grad and classes with bounded expansion. II: Algorithmic aspects
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
- Tree-depth, subgraph coloring and homomorphism bounds
- Tree-Related Widths of Graphs and Hypergraphs
- Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs
- On Digraph Width Measures in Parameterized Algorithmics
- Unnamed Item
- Unnamed Item
- Unnamed Item