Fingerprint
Dive into the research topics of 'Computing unique maximum matchings in O(m) time for König–Egerváry graphs and unicyclic graphs'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
Computing unique maximum matchings in O(m) time for König–Egerváry graphs and unicyclic graphs
Vadim E. Levit, Eugen Mandrescu
Research output: Contribution to journal › Article › peer-review