Non-crossing shortest paths in undirected unweighted planar graphs in linear time (Q2097216)
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 7615732
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-crossing shortest paths in undirected unweighted planar graphs in linear time |
scientific article; zbMATH DE number 7615732 |
Statements
Non-crossing shortest paths in undirected unweighted planar graphs in linear time (English)
0 references
11 November 2022
0 references
planar graphs
0 references
non-crossing paths
0 references
shortest paths
0 references
undirected unweighted graphs
0 references
multiple pairs
0 references
external face
0 references
0 references
0 references
