Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs
type: Item
instance of: scholarly article
title: Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs
zbMATH Open document ID: 1253.05090
author: MohammadAli Safari
published in: Theoretical Computer Science
publication date: 2013-01-07T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6122453
zbMATH Keywords: hyper-D-width
zbMATH Keywords: hyper-T-width
zbMATH Keywords: connectivity
zbMATH Keywords: hypergraphs
zbMATH Keywords: hyper-T-decompositions
zbMATH Keywords: minimum vertex cover
zbMATH Keywords: minimum dominating set
zbMATH Keywords: multicut
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.09.010
OpenAlex ID: W1985640436
cites work: Q3576650
cites work: Easy problems for tree-decomposable graphs
cites work: On complexity of single-minded auction
cites work: Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
cites work: Fixed-parameter approximation: conceptual framework and approximability results
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Hypertree decompositions and tractable queries
cites work: Generalized hypertree decompositions: NP-hardness and tractable variants
cites work: Directed tree-width
DOI: 10.1016/J.TCS.2012.09.010
description: scientific article; zbMATH DE number 6122453