Faster shortest-path algorithms for planar graphs (Q5906822)
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: Faster shortest-path algorithms for planar graphs |
scientific article; zbMATH DE number 1079978
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster shortest-path algorithms for planar graphs |
scientific article; zbMATH DE number 1079978 |
Statements
Faster shortest-path algorithms for planar graphs (English)
0 references
28 October 1997
0 references
linear-time algorithm
0 references
0.9999999
0 references
0.97422886
0 references
0.93898016
0 references
0.93433726
0 references
0.93088084
0 references
0 references
0.92510295
0 references
