d-Transversals of stable sets and vertex covers in weighted bipartite graphs
- 12 June 2012
- journal article
- research article
- Published by Elsevier in Journal of Discrete Algorithms
- Vol. 17, 95-102
Abstract
No abstract availableKeywords
Funding Information
- École Polytechnique Fédérale de Lausanne
- ENSTA Paris-Tech
This publication has 6 references indexed in Scilit:
- The most vital nodes with respect to independent set and vertex coverDiscrete Applied Mathematics, 2011
- Minimum d-blockers and d-transversals in graphsJournal of Combinatorial Optimization, 2010
- Blockers and transversalsDiscrete Mathematics, 2009
- Crown reductions for the Minimum Weighted Vertex Cover problemDiscrete Applied Mathematics, 2008
- A combinatorial algorithm for weighted stable sets in bipartite graphsDiscrete Applied Mathematics, 2006
- Finding the k most vital edges with respect to minimum spanning trees for fixed kDiscrete Applied Mathematics, 2001