\(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs
From MaRDI portal
Publication:2376794
DOI10.1016/j.jda.2012.06.002zbMath1268.05192MaRDI QIDQ2376794
Dominique de Werra, Bernard Ries, Cédric Bentz, Marie-Christine Costa, Christophe Picouleau
Publication date: 24 June 2013
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2012.06.002
matching; polynomial time algorithm; network flow; vertex cover; maximum weight stable set; weighted bipartite graph; minimum total cost; minimum d-transversal; minimum weight vertex
05C90: Applications of graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)