Name
Abstract | ||
|---|---|---|
The matching preclusion number of a graph is the minimal number of edges whose removal destroys all perfect matchings. We provide algorithms and hardness results for the task of increasing the matching preclusion number from one to two in bipartite graphs at minimal cost. Our motivation is to make matchings of a graph robust against the failure of a single edge. Our methods rely on a close relationship to the classical strong connectivity augmentation problem. For the unit weight problem we provide a deterministic $log_2 n$-factor approximation algorithm, as well as polynomial-time algorithms for graphs of bounded treewidth and chordal-bipartite graphs. For general weights we prove a dichotomy theorem characterizing minor-closed graph classes which allow for a polynomial-time algorithm. |
Year | Venue | DocType |
|---|---|---|
2019 | STACS | Conference |
Volume | Citations | PageRank |
abs/1805.01299 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Viktor Bindewald | 1 | 1 | 1.09 |
| Felix Hommelsheim | 2 | 0 | 0.68 |
| Moritz Mühlenthaler | 3 | 17 | 5.37 |
| Oliver Schaudt | 4 | 95 | 21.74 |