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 |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8228436708450317
0 references
0.8186212778091431
0 references
0.8150871396064758
0 references
0.8134260773658752
0 references
