Perfect matching interdiction problem restricted to a stable vertex

DOI10.1007/s40819-018-0553-3zbMath1401.05243OpenAlexW2891446515WikidataQ129250125 ScholiaQ129250125MaRDI QIDQ1794725

Gholam Hassan Shirdel, Nasrin Kahkeshani

Publication date: 15 October 2018

Published in: International Journal of Applied and Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40819-018-0553-3

zbMATH Keywords

weighted graphperfect matchinginterdictionstable vertex

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Nodal interdiction
• Matching interdiction
• The multi-terminal maximum-flow network-interdiction problem
• Network flow interdiction on planar graphs
• Most vital links and nodes in weighted networks
• Multi-level programming and conflict resolution
• Deterministic network interdiction
• The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
• Finding the n Most Vital Links in Flow Networks
• Shortest-path network interdiction
• Optimal interdiction of a supply network

This page was built for publication: Perfect matching interdiction problem restricted to a stable vertex