Computing unique maximum matchings in $$O(m)$$ O ( m ) time for König–Egerváry graphs and unicyclic graphs
Crossref DOI link: https://doi.org/10.1007/s10878-015-9875-9
Published Online: 2015-04-17
Published Print: 2016-07
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Levit, Vadim E.
Mandrescu, Eugen
Text and Data Mining valid from 2015-04-17