Minimum d-blockers and d-transversals in graphs
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 ℘. 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 of stable sets or vertex covers in bipartite and in split graphs.
KeywordsTransversal Blocker Cover Bipartite graph Split graph s–t path s–t cut Stable set Bilevel programming
Unable to display preview. Download preview PDF.
- Ahuja RK, Magnanti TL, Orlin JB (1993) Networks flows: theory, algorithm, and applications. Prentice Hall, New York Google Scholar
- Bonomo F, Durán G (2004) Computational complexity of classical problems for hereditary classes of graphs. Pesquisa operacional, vol 24, pp 413–434 or Electronic notes in discrete mathematics, vol 18, pp 41–46 Google Scholar
- Frank A (1994) On the edge connectivity algorithm of Nagamochi and Ibaraki, Unpublished report Google Scholar
- Lee C-M (2009) Variations of maximum-clique transversal sets on graphs. Ann Oper Res, to appear Google Scholar
- Spurr W, Spurr K (1995) Alferd Packer’s high protein gourmet cookbook. Centennial Publications, Grand Junction Google Scholar