Minimum \(d\)-blockers and \(d\)-transversals in graphs
From MaRDI portal
Publication:411244
DOI10.1007/s10878-010-9334-6zbMath1263.90110MaRDI QIDQ411244
Dominique de Werra, Marie-Christine Costa, Christophe Picouleau
Publication date: 4 April 2012
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-010-9334-6
bipartite graph; split graph; stable set; transversal; cover; bilevel programming; \(s\)-\(t\) cut; \(s\)-\(t\) path; blocker