Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs (Q328720): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-015-9875-9 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-015-9875-9 / rank | |||
Normal rank | |||
Latest revision as of 14:32, 9 December 2024
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
unique perfect matching
0 references
König-Egerváry graph
0 references
unicyclic graph
0 references
Karp-Sipser leaf-removal algorithm
0 references
core
0 references
0 references
0 references
0 references
