Blockers and Transversals - ENSTA Paris - École nationale supérieure de techniques avancées Paris Access content directly
Journal Articles Discrete Mathematics Year : 2009

Blockers and Transversals

Rico Zenklusen
  • Function : Author
Bernard Ries
  • Function : Author
Christophe Picouleau
Marie-Christine Costa
Cédric Bentz

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.

Dates and versions

hal-00975349 , version 1 (08-04-2014)

Identifiers

Cite

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⟩

Collections

ENSTA UMA_ENSTA
62 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More