Minimum d-Transversals of Maximum-Weight Stable Sets in Trees - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Minimum d-Transversals of Maximum-Weight Stable Sets in Trees

Abstract

Given an integer d and a weighted tree T, we show how to find in polynomial time a minimum d-transversal of all maximum-weight stable sets in T, i.e., a set of vertices of minimum size having at least d vertices in common with every maximum-weight stable set. Our proof relies on new structural results for maximum-weight stable sets on trees.
Fichier principal
Vignette du fichier
Bentz2011.pdf (105.98 Ko) Télécharger le fichier
DIMAP.pdf (743.6 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Origin : Files produced by the author(s)

Dates and versions

hal-01125892 , version 1 (28-11-2020)

Licence

Attribution

Identifiers

Cite

Christophe Picouleau, Cédric Bentz, Marie-Christine Costa, Dominique de Werra, Bernard Ries. Minimum d-Transversals of Maximum-Weight Stable Sets in Trees. European conference on combinatorics, graph theory and applications. EuroComb'11, Aug 2011, Budapest, Hungary. pp.129-134, ⟨10.1016/j.endm.2011.09.022⟩. ⟨hal-01125892⟩
74 View
63 Download

Altmetric

Share

Gmail Facebook X LinkedIn More