Constant-work-space algorithms for shortest paths in trees and simple polygons (Q2865044)
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: Constant-work-space algorithms for shortest paths in trees and simple polygons |
scientific article; zbMATH DE number 6234161
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constant-work-space algorithms for shortest paths in trees and simple polygons |
scientific article; zbMATH DE number 6234161 |
Statements
28 November 2013
0 references
computing instead of storing
0 references
simulated parallelization
0 references
Constant-work-space algorithms for shortest paths in trees and simple polygons (English)
0 references
0.9633079767227172
0 references
0.8904053568840027
0 references
0.8724956512451172
0 references
0.8448824882507324
0 references
0.80328369140625
0 references
