Non-crossing shortest paths lengths in planar graphs in linear time (Q6057315)
From MaRDI portal
scientific article; zbMATH DE number 7745699
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Non-crossing shortest paths lengths in planar graphs in linear time |
scientific article; zbMATH DE number 7745699 |
Statements
Non-crossing shortest paths lengths in planar graphs in linear time (English)
0 references
4 October 2023
0 references
shortest paths
0 references
undirected planar graphs
0 references
non-crossing paths
0 references
0 references
