Online matching in regular bipartite graphs (Q5087843)
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 7552466
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Online matching in regular bipartite graphs |
scientific article; zbMATH DE number 7552466 |
Statements
Online Matching in Regular Bipartite Graphs (English)
0 references
4 July 2022
0 references
online algorithm
0 references
competitive ratio
0 references
advice complexity
0 references
matching
0 references
bipartite graph
0 references
0 references
0.8950955271720886
0 references
0.8902775645256042
0 references
0.8625281453132629
0 references
0.8483676314353943
0 references
