Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs

Authors:
Mohammadali Safari
Affiliations:
-
Venue:
Theoretical Computer Science
Year:
2012

Citing 7
Cited 0

Easy problems for tree-decomposable graphs

Journal of Algorithms
Directed tree-width

Journal of Combinatorial Theory Series B
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width

Journal of Algorithms
On complexity of single-minded auction

Journal of Computer and System Sciences
Generalized hypertree decompositions: np-hardness and tractable variants

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results

Algorithmica
Hypertree decompositions: structure, algorithms, and applications

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We introduce hyper-D-width and hyper-T-width as the first stable (see Definition 3) measures of connectivity for hypergraphs. After studying some of their properties and, in particular, proposing an algorithm for computing nearly optimal hyper-T-decomposition when hyper-T-width is constant, we introduce some applications of hyper-D-width and hyper-T-width in solving hard problems such as minimum vertex cover, minimum dominating set, and multicut.