DeepAI AI Chat
Log In Sign Up

How to Secure Matchings Against Edge Failures

by   Viktor Bindewald, et al.

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 _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.


page 1

page 2

page 3

page 4


Exact Matching: Correct Parity and FPT Parameterized by Independence Number

Given an integer k and a graph where every edge is colored either red or...

Excluding Single-Crossing Matching Minors in Bipartite Graphs

By a seminal result of Valiant, computing the permanent of (0,1)-matrice...

The Perfect Matching Reconfiguration Problem

We study the perfect matching reconfiguration problem: Given two perfect...

Killing a Vortex

The Structural Theorem of the Graph Minors series of Robertson and Seymo...

Stabilizing Weighted Graphs

An edge-weighted graph G=(V,E) is called stable if the value of a maximu...

Propagating Conjunctions of AllDifferent Constraints

We study propagation algorithms for the conjunction of two AllDifferent ...

Spectrally Robust Graph Isomorphism

We initiate the study of spectral generalizations of the graph isomorphi...