Computing Unique Maximum Matchings in O(m) time for Konig-Egervary Graphs and Unicyclic Graphs.

Vadim E. Levit, Eugen Mandrescu

Research output: Working paperPreprint

Original languageEnglish
Volumeabs/1402.2903
StatePublished - 2014

Publication series

NameCoRR

Cite this