Better bounds for incremental frequency allocation in bipartite graphs (Q386900)
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: Better bounds for incremental frequency allocation in bipartite graphs |
scientific article; zbMATH DE number 6237343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Better bounds for incremental frequency allocation in bipartite graphs |
scientific article; zbMATH DE number 6237343 |
Statements
Better bounds for incremental frequency allocation in bipartite graphs (English)
0 references
11 December 2013
0 references
online algorithms
0 references
frequency allocation
0 references
graph algorithms
0 references
0.999149203300476
0 references
0.8479716181755066
0 references
0.8394448757171631
0 references
0.8209105730056763
0 references
0.8059147000312805
0 references
