Robust recoverable perfect matchings

DOI10.1002/net.21624zbMath1386.05151OpenAlexW2120542281WikidataQ56638367 ScholiaQ56638367MaRDI QIDQ4642438

Mitre C. Dourado, Dieter Rautenbach, Fábio Protti, Aline Ribeiro de Almeida, Dirk Meierling, 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

robustnessmatchingmatching preclusionrecoverability

Mathematics Subject Classification ID

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

Related Items (6)

A parameterized view to the robust recoverable base problem of matroids under structural uncertainty ⋮ Matching preclusion number in product graphs ⋮ How to Secure Matchings against Edge Failures ⋮ A note on generalized matching preclusion in bipartite graphs ⋮ Unnamed Item ⋮ How to Secure Matchings Against Edge Failures

This page was built for publication: Robust recoverable perfect matchings