HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Hypertree-Width and Related Hypergraph Invariants

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.
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download

https://hal.inria.fr/hal-01184381
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Friday, August 14, 2015 - 11:38:40 AM
Last modification on : Wednesday, October 13, 2021 - 7:58:04 PM
Long-term archiving on: : Sunday, November 15, 2015 - 11:04:19 AM

File

dmAE0102.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

139

Files downloads

706