Non-crossing shortest paths lengths in planar graphs in linear time (Q6153472)
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: Non-crossing shortest paths lengths in planar graphs in linear time |
scientific article; zbMATH DE number 7804726
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-crossing shortest paths lengths in planar graphs in linear time |
scientific article; zbMATH DE number 7804726 |
Statements
Non-crossing shortest paths lengths in planar graphs in linear time (English)
0 references
14 February 2024
0 references
shortest paths
0 references
undirected planar graphs
0 references
non-crossing paths
0 references
0 references
0.8763794898986816
0 references
0.8019335269927979
0 references
0.7977359890937805
0 references
0.7804273962974548
0 references
0.7671551704406738
0 references
