Skip to Main content Skip to Navigation
New interface
Journal articles

Blockers and Transversals

Abstract : 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.
Document type :
Journal articles
Complete list of metadata
Contributor : Aurélien Arnoux Connect in order to contact the contributor
Submitted on : Tuesday, April 8, 2014 - 2:36:00 PM
Last modification on : Wednesday, May 11, 2022 - 12:06:05 PM

Links full text




Rico Zenklusen, Bernard Ries, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa, et al.. Blockers and Transversals. Discrete Mathematics, 2009, 13, pp.4306--4314. ⟨10.1016/j.disc.2009.01.006⟩. ⟨hal-00975349⟩



Record views