On improving matchings in trees, via bounded-length augmentations
type: Item
instance of: scholarly article
title: On improving matchings in trees, via bounded-length augmentations
zbMATH Open document ID: 1398.05157
author: Julien Bensmail
author: Valentin Garnero
author: Nicolas Nisse
published in: Discrete Applied Mathematics
publication date: 2018-10-26T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6966405
zbMATH Keywords: maximum matchings
zbMATH Keywords: bounded-length augmentations
zbMATH Keywords: trees
MaRDI profile type: Publication
full work available at URL: j.dam.2018.05.021
OpenAlex ID: W2725137878
cites work: TWO THEOREMS IN GRAPH THEORY
cites work: Recovery of disrupted airline operations using \(k\)-maximum matching in graphs
cites work: Linear-Time Approximation for Maximum Weight Matching
cites work: Paths, Trees, and Flowers
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Q5519710
Wikidata QID: Q129739180
DOI: 10.1016/J.DAM.2018.05.021
Recommended article: On tree-constrained matchings and generalizations
Recommended article: On Tree-Constrained Matchings and Generalizations
Recommended article: Shortest Augmenting Paths for Online Matchings on Trees
Recommended article: A tight bound for shortest augmenting paths on trees
Recommended article: Shortest augmenting paths for online matchings on trees
Recommended article: An Improved Approximation Algorithm for the Matching Augmentation Problem
Recommended article: An efficient algorithm for some tree matching problems
Recommended article: Q5091032
Recommended article: Almost optimal algorithms for diameter-optimally augmenting trees
description: scientific article; zbMATH DE number 6966405