# Recovery of disrupted airline operations using k-Maximum Matching in graphs

Valentin Garnero

April 11, 2018 | 13h00-14h00 | Salle 110 - Département Informatique, Polytech Tours

Due to a classical result of Berge, it is known that a matching of any graph can be turned into a maximum matching by repeatedly augmenting alternating paths whose ends are not covered. In a recent work, Nisse, Salch and Weber considered the influence, on this process, of augmenting paths with length at most k only. Given a graph G, an initial matching M ⊆

E(G) and an odd integer k, the problem is to find a longest sequence of augmenting paths of length at most k that can be augmented sequentially from M . They proved that, when only paths of length at most k = 3 can be augmented, computing such a longest sequence can be done in polynomial time for any graph, while the same problem for any k ≥ 5 is NP-hard. Although the latter result remains true for bipartite graphs, the status of the complexity of the same problem for trees is not known.

This work is dedicated to the complexity of this problem for trees. On the positive side, we first show that it can be solved in polynomial time for more classes of trees, namely bounded-degree trees (via a dynamic programming approach), caterpillars and trees where the nodes with degree at least 3 are sufficiently far apart. On the negative side, we show that, when only paths of length exactly k can be augmented, the problem becomes NP-hard already for k = 3, in the class of planar bipartite graphs with maximum degree 3 and arbitrary large girth. We also show that the latter problem is NP-hard in trees when k is part of the input.

E(G) and an odd integer k, the problem is to find a longest sequence of augmenting paths of length at most k that can be augmented sequentially from M . They proved that, when only paths of length at most k = 3 can be augmented, computing such a longest sequence can be done in polynomial time for any graph, while the same problem for any k ≥ 5 is NP-hard. Although the latter result remains true for bipartite graphs, the status of the complexity of the same problem for trees is not known.

This work is dedicated to the complexity of this problem for trees. On the positive side, we first show that it can be solved in polynomial time for more classes of trees, namely bounded-degree trees (via a dynamic programming approach), caterpillars and trees where the nodes with degree at least 3 are sufficiently far apart. On the negative side, we show that, when only paths of length exactly k can be augmented, the problem becomes NP-hard already for k = 3, in the class of planar bipartite graphs with maximum degree 3 and arbitrary large girth. We also show that the latter problem is NP-hard in trees when k is part of the input.