[CDPb11] Minimum d-Transversals of Maximum-Weight Stable Sets in Trees

Conférence Internationale avec comité de lecture : European conference on combinatorics, graph theory and applications EuroComb'11, Electronics Notes in Discrete Mathematics, August 2011, Vol. 38, pp.129-134, Bupapest, Hongrie, (DOI: 10.1016/j.endm.2011.09.022)

Auteurs: M.-C. Costa , D. de Werra , C. Picouleau , B. Ries , C. Bentz

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

Equipe: oc

Collaboration: LAMSADE

BibTeX

@inproceedings {
	CDPb11,
	title	=	"{Minimum d-Transversals of Maximum-Weight Stable Sets in Trees}",
	author	=	" M.-C. Costa and D. de Werra and C. Picouleau and B. Ries and C. Bentz ",
	booktitle	=	"{European conference on combinatorics, graph theory and applications EuroComb'11, Electronics Notes in Discrete Mathematics}",
	year	=	2011,
	month	=	"August",
	volume	=	38,
	pages	=	"129-134",
	address	=	"Bupapest, Hongrie",
	doi	=	"10.1016/j.endm.2011.09.022",
}