Lower and upper competitive bounds for online directed graph exploration (Q343923)
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 6657245
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower and upper competitive bounds for online directed graph exploration |
scientific article; zbMATH DE number 6657245 |
Statements
Lower and upper competitive bounds for online directed graph exploration (English)
0 references
29 November 2016
0 references
graph exploration
0 references
online algorithms
0 references
competitive analysis
0 references
directed graphs
0 references
0 references
0 references
0 references
0 references
0.857230007648468
0 references
0.8544415831565857
0 references
0.8309927582740784
0 references
0.8256856203079224
0 references
0.8080870509147644
0 references
