Hypertree-Width and Related Hypergraph Invariants - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

Hypertree-Width and Related Hypergraph Invariants

Georg Gottlob
  • Function : Author
  • PersonId : 864382
Martin Grohe
  • Function : Author
  • PersonId : 857863

Abstract

We study the notion of hypertree-width of hypergraphs. We prove that, up to a constant factor, hypertree-width is the same as a number of other hypergraph invariants that resemble graph invariants such as bramble-number, branch-width, linkedness, and the minimum number of cops required to win Seymour and Thomas's robber and cops game.
Fichier principal
Vignette du fichier
dmAE0102.pdf (135.84 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184381 , version 1 (14-08-2015)

Identifiers

Cite

Isolde Adler, Georg Gottlob, Martin Grohe. Hypertree-Width and Related Hypergraph Invariants. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.5-10, ⟨10.46298/dmtcs.3424⟩. ⟨hal-01184381⟩

Collections

INSMI TDS-MACS
149 View
773 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More