Robust recoverable perfect matchings

DOI10.1002/NET.21624MaRDI QIDQ4642438zbMATH OpenOpenAlexWikidataFDO

Authors Mitre C. Dourado, Dirk Meierling, Dieter Rautenbach, Fábio Protti, Aline Ribeiro de Almeida, Lucia Draque Penso

Publication date 23 May 2018

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.21624

zbMATH Keywords

matchingmatching preclusionrecoverabilityrobustness

Mathematics Subject Classification ID

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

Recommendations

• Robust matchings and matroid intersections
• Perfect matchings after vertex deletions
• Strong matching preclusion
• Conditional matching preclusion sets
• Robust matchings and matroid intersections

Cited in

(15)

• Matching preclusion number in product graphs
• A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
• A note on generalized matching preclusion in bipartite graphs
• scientific article; zbMATH DE number 1617264 (Why is no real title available?)
• How to Secure Matchings Against Edge Failures
• Maintaining perfect matchings at low cost
• How to Secure Matchings against Edge Failures
• On verification and design of input matrix for robust linear systems: complexity and polynomially solvable cases
• Recoverable robust cardinality constrained maximization with commitment of a submodular function
• Parameterized complexity of submodular minimization under uncertainty
• Higher order matching preclusion for regular interconnection networks
• Parameterized complexity of submodular minimization under uncertainty
• Recoverable robust cardinality constrained maximization with commitment of a submodular function
• On the complexity of recoverable robust optimization in the polynomial hierarchy
• Fault-tolerant matroid bases

This page was built for publication: Robust recoverable perfect matchings

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