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

DOI10.1016/j.ejor.2017.12.033MaRDI QIDQ6167856

Nicolas Nisse, A. Salch, Valentin Weber

Publication date: 10 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

complexitymatchinggraph theoryaugmenting paths

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Recovery of disrupted airline operations using \(k\)-maximum matching in graphs
• Linear-Time Approximation for Maximum Weight Matching
• TWO THEOREMS IN GRAPH THEORY
• Determining the thickness of graphs is NP-hard
• Paths, Trees, and Flowers
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

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