Hypertree-depth and minors in hypergraphs
type: Item
instance of: scholarly article
title: Hypertree-depth and minors in hypergraphs
zbMATH Open document ID: 1253.05107
author: Isolde Adler
author: Tomáš Gavenčiak
author: Tereza Klimošová
published in: Theoretical Computer Science
publication date: 2013-01-07T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C83
zbMATH DE Number: 6122458
zbMATH Keywords: hypertree-depth
zbMATH Keywords: robber and marshals game
zbMATH Keywords: minors in hypergraphs
zbMATH Keywords: tree-depth
zbMATH Keywords: hypertree-width
zbMATH Keywords: hyperpath-width
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.09.007
OpenAlex ID: W2000015739
cites work: Q5469338
cites work: Tree-Related Widths of Graphs and Hypergraphs
cites work: Parameterized and exact computation. 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10--11, 2009. Revised selected papers
cites work: Q3577833
cites work: Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs
cites work: The complexity of induced minors and related problems
cites work: On Digraph Width Measures in Parameterized Algorithmics
cites work: Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
cites work: Q3821580
cites work: Tree-depth, subgraph coloring and homomorphism bounds
cites work: Grad and classes with bounded expansion. I: Decompositions
cites work: Grad and classes with bounded expansion. II: Algorithmic aspects
cites work: Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
cites work: Graph minors. XIII: The disjoint paths problem
cites work: Graph minors. III. Planar tree-width
DOI: 10.1016/J.TCS.2012.09.007
description: scientific article; zbMATH DE number 6122458