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

Christophe Picouleau, Cédric Bentz, Bernard Ries,
Dominique de Werra and Marie-Christine Costa

august, 2011

Type de publication :

Conférence internationale avec actes

Conférence :

European conference on combinatorics, graph theory and applications EuroComb'11, ENDM

DOI :

10.1016/j.endm.2011.09.022

Mots clés :

graph, stable set, tree, d-transversal

Résumé :

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

BibTeX :

@inproceedings{Pic-Ben-Rie-DeW-Cos-2011,
    author={Christophe Picouleau and Cédric Bentz and Bernard Ries and 
           Dominique de Werra and Marie-Christine Costa },
    title={Minimum d-Transversals of Maximum-Weight Stable Sets in Trees },
    doi={10.1016/j.endm.2011.09.022 },
    organization={European conference on combinatorics, graph theory and 
           applications EuroComb'11, ENDM },
    year={2011 },
    month={8},
    volume={38 },
    pages={129--134},
}