On improving matchings in trees, via bounded-length augmentations

Julien Bensmail 1 Valentin Garnero 1 Nicolas Nisse 1
1 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : 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.
Type de document :
[Research Report] Université Côte d'Azur. 2017
Liste complète des métadonnées

Contributeur : Julien Bensmail <>
Soumis le : mardi 4 juillet 2017 - 10:49:32
Dernière modification le : mercredi 5 juillet 2017 - 01:17:50


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01555465, version 1



Julien Bensmail, Valentin Garnero, Nicolas Nisse. On improving matchings in trees, via bounded-length augmentations. [Research Report] Université Côte d'Azur. 2017. <hal-01555465>



Consultations de
la notice


Téléchargements du document