Perfect matching interdiction problem restricted to a stable vertex

DOI10.1007/S40819-018-0553-3MaRDI QIDQ1794725zbMATH OpenOpenAlexWikidataFDO

Authors Gholam Hassan Shirdel, N. 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

interdictionperfect matchingstable vertexweighted graph

Mathematics Subject Classification ID

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

Recommendations

• Stable matchings through fixed points and graphs
• A generalization of the stable matching problem
• Stable Matchings, Optimal Assignments, and Linear Programming
• Stable matchings and linear programming
• A further note on the stable matching problem
• Perfect matchings with restricted intersection in cubic graphs
• Stable matchings with covering constraints: a complete computational trichotomy
• Implementable stable solutions to pure matching problems
• Symmetric interdiction for matching problems

Cites work

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

Cited in

(1)

• The matching interdiction problem in dendrimers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1794725)