Shortest augmenting paths for online matchings on trees (Q1743118)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6859224
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest augmenting paths for online matchings on trees |
scientific article; zbMATH DE number 6859224 |
Statements
Shortest augmenting paths for online matchings on trees (English)
0 references
12 April 2018
0 references
online matchings
0 references
bipartite matchings
0 references
approximate matchings
0 references
shortest augmenting paths
0 references
dynamic graph algorithms
0 references
0.9138053
0 references
0.89032114
0 references
0 references
0.88033634
0 references
0.8779639
0 references
0.87232476
0 references
0.8639054
0 references
