L. Bui, S. Sanghavi, and R. Srikant, Distributed Link Scheduling With Constant Overhead, IEEE/ACM Transactions on Networking, vol.17, issue.5, pp.1467-1480, 2009.
DOI : 10.1109/TNET.2009.2013621

J. Edmonds, Paths, trees, and flowers, Journal canadien de math??matiques, vol.17, issue.0, pp.449-467, 1965.
DOI : 10.4153/CJM-1965-045-4

J. E. Hopcroft and R. M. Karp, An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs, SIAM Journal on Computing, vol.2, issue.4, pp.225-231, 1973.
DOI : 10.1137/0202019

D. Michalek, H. Balakrishnanmv80-]-s, V. V. Micali, and . Vazirani, Dynamic reconfiguration of terminal airspace during convective weather An O( |V ||E|) algorithm for finding maximum matching in general graphs, 49th Conference on Decision and Control 21st Symp. on Foundations of Comp. Sc. (FOCS), pp.4875-4881, 1980.

N. Nisse, A. Salch, and V. Weber, Recovery of disrupted airline operations, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01116487

X. Wu and R. Srikant, Regulated maximal matching : A distributed scheduling algorithm for multi-hop wireless networks with nodeexclusive spectrum sharing, IEEE Conf. on Decision and Control, 2005.