Computing unique maximum matchings in O(m) time for König-Egerváry graphs and unicyclic graphs

Vadim E. Levit, Eugen Mandrescu. Computing unique maximum matchings in O(m) time for König-Egerváry graphs and unicyclic graphs. J. Comb. Optim., 32(1):267-277, 2016. [doi]

Abstract

Abstract is missing.