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.
Type de document :
Communication dans un congrès
Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.5-10, 2005, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [6 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01184381
Contributeur : Coordination Episciences Iam <>
Soumis le : vendredi 14 août 2015 - 11:38:40
Dernière modification le : mercredi 14 novembre 2018 - 14:30:03
Document(s) archivé(s) le : dimanche 15 novembre 2015 - 11:04:19

Fichier

dmAE0102.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01184381, version 1

Collections

Citation

Isolde Adler, Georg Gottlob, Martin Grohe. Hypertree-Width and Related Hypergraph Invariants. Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.5-10, 2005, DMTCS Proceedings. 〈hal-01184381〉

Partager

Métriques

Consultations de la notice

280

Téléchargements de fichiers

297