%0 Journal Article
%T Blockers and Transversals
%+ Optimisation et commande (OC)
%A Zenklusen, Rico
%A Ries, Bernard
%A Picouleau, Christophe
%A de Werra, Dominique
%A Costa, Marie-Christine
%A Bentz, Cédric
%< avec comité de lecture
%@ 0012-365X
%J Discrete Mathematics
%I Elsevier
%V 13
%P 4306--4314
%8 2009
%D 2009
%R 10.1016/j.disc.2009.01.006Journal articles
%X We explore connections between d-blockers B in a graph G = (V;E) (i.e. subsets of edges whose removal decreases by at least d the cardinality of maximum matchings) and d-transversals T (i.e. subsets of edges such that every maximum matching M has at least d edges in T. Special classes of graphs are examined which include complete graphs, regular bipartite graphs, grid graphs, chains and cycles. We also study the complexity status of finding minimum transversals and blockers. Algorithms for d-transversals and d- blockers based on dynamic programming are given for trees.
%G English
%L hal-00975349
%U https://hal-ensta-paris.archives-ouvertes.fr/hal-00975349
%~ ENSTA
%~ UMA_ENSTA