An inverse-Ackermann type lower bound for online minimum spanning tree verification (Q858114)
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: An inverse-Ackermann type lower bound for online minimum spanning tree verification |
scientific article; zbMATH DE number 5082297
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An inverse-Ackermann type lower bound for online minimum spanning tree verification |
scientific article; zbMATH DE number 5082297 |
Statements
An inverse-Ackermann type lower bound for online minimum spanning tree verification (English)
0 references
8 January 2007
0 references
minimum spanning tree verification
0 references
0.8649233
0 references
0.8634114
0 references
0.8587567
0 references
0.8565391
0 references
0.82345587
0 references
0.8220146
0 references
0.81968147
0 references
0.8159964
0 references
