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

Abstract : We give a polynomial time algorithm fot the Minimum d-Transversals of Maximum-Weight Stable Sets in Trees problem
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01125892
Contributor : Laboratoire Cedric <>
Submitted on : Friday, March 6, 2015 - 11:32:09 AM
Last modification on : Saturday, February 9, 2019 - 1:25:24 AM

Identifiers

  • HAL Id : hal-01125892, version 1

Collections

Citation

Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries, Cédric Bentz. Minimum d-Transversals of Maximum-Weight Stable Sets in Trees. European conference on combinatorics, graph theory and applications EuroComb'11, Electronics Notes in Discrete Mathematics, Aug 2011, Bupapest, Hungary. pp.129-134. ⟨hal-01125892⟩

Share

Metrics

Record views

85