Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs (Q328720)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs |
scientific article |
Statements
Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs (English)
0 references
20 October 2016
0 references
