Shortest Augmenting Paths for Online Matchings on Trees (Q2788991)
From MaRDI portal
scientific article; zbMATH DE number 7458776
- A tight bound for shortest augmenting paths on trees
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortest Augmenting Paths for Online Matchings on Trees |
scientific article; zbMATH DE number 7458776 |
|
Statements
Shortest Augmenting Paths for Online Matchings on Trees (English)
0 references
A tight bound for shortest augmenting paths on trees (English)
0 references
26 February 2016
0 references
18 January 2022
0 references
online algorithm
0 references
bipartite matching
0 references
trees
0 references
