Minimum d-blockers and d-transversals in graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Combinatorial Optimization Année : 2011

Minimum d-blockers and d-transversals in graphs

Résumé

We consider a set V of elements and an optimization problem on V : the search for a maximum (or minimum) cardinality subset of V verifying a given property P. A d-transversal is a subset of V which intersects any optimum solution in at least d elements while a d-blocker is a subset of V whose removal deteriorates the value of an optimum solution by at least d. We present some general characteristics of these problems, we review some situations which have been studied (matchings, s . t paths and s . t cuts in graphs) and we study d-transversals and d-blockers for new problems as stable sets or vertex covers in bipartite graphs.
Fichier principal
Vignette du fichier
ArticleJOCO.pdf (299.77 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00973849 , version 1 (05-04-2016)

Identifiants

Citer

Marie-Christine Costa, Dominique de Werra, Christophe Picouleau. Minimum d-blockers and d-transversals in graphs. Journal of Combinatorial Optimization, 2011, 22 (4), pp.857-872. ⟨10.1007/s10878-010-9334-6⟩. ⟨hal-00973849⟩
78 Consultations
163 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More