Matching interdiction
Author:
- Rico ZenklusenRZRico Zenklusen
- 1 August 2010
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 158 (15) , 1676-1690
Abstract
No abstract availableKeywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a gridDiscrete Mathematics, 2010
- Blockers and transversalsDiscrete Mathematics, 2009
- The 0–1 inverse maximum stable set problemDiscrete Applied Mathematics, 2008
- NP-completeness results for edge modification problemsDiscrete Applied Mathematics, 2006
- Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithmsJournal of Graph Theory, 2006
- Shortest‐path network interdictionNetworks, 2002
- Complexity classification of some edge modification problemsDiscrete Applied Mathematics, 2001
- A partial k-arboretum of graphs with bounded treewidthTheoretical Computer Science, 1998
- Finding the most vital arcs in a networkOperations Research Letters, 1989
- A problem in network interdictionNaval Research Logistics Quarterly, 1978