Recovery of disrupted airline operations using k-maximum matching in graphs

DOI10.1016/J.ENDM.2017.10.002MaRDI QIDQ2413142zbMATH OpenOpenAlexFDO

Authors Julien Bensmail, Valentin Garnero, Nicolas Nisse, A. Salch, Valentin Weber

Publication date 9 April 2018

Full work available at URL https://doi.org/10.1016/j.endm.2017.10.002

zbMATH Keywords

augmenting pathscomplexitymatchingtrees

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On improving matchings in trees, via bounded-length augmentations
• Path-matching problems
• scientific article; zbMATH DE number 795216
• Matchability and \(k\)-maximal matchings
• scientific article; zbMATH DE number 19225

Cites work

• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Paths, Trees, and Flowers
• TWO THEOREMS IN GRAPH THEORY

Cited in

(2)

• On improving matchings in trees, via bounded-length augmentations
• Recovery of disrupted airline operations using \(k\)-maximum matching in graphs

This page was built for publication: Recovery of disrupted airline operations using \(k\)-maximum matching in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413142)