Non-crossing shortest paths in undirected unweighted planar graphs in linear time (Q2097216): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4285207083 / rank | |||
Normal rank |
Revision as of 00:37, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Non-crossing shortest paths in undirected unweighted planar graphs in linear time |
scientific article |
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