Path-Based Supports for Hypergraphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Discrete Algorithms Année : 2012

Path-Based Supports for Hypergraphs

Résumé

A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-hard to decide whether a path-based support has a monotone drawing, to determine a path-based support with the minimum number of edges, or to decide whether there is a planar path-based support, we show that a path-based tree support can be computed in polynomial time if it exists.
Fichier principal
Vignette du fichier
pathbased.pdf (989.69 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00735894 , version 1 (27-03-2013)

Identifiants

Citer

Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry. Path-Based Supports for Hypergraphs. Journal of Discrete Algorithms, 2012, 14, pp.248-261. ⟨10.1016/j.jda.2011.12.009⟩. ⟨hal-00735894⟩
259 Consultations
383 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More