Non-crossing shortest paths in undirected unweighted planar graphs in linear time (Q2097216)

From MaRDI portal
Revision as of 10:20, 22 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
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
    0 references
    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

    Identifiers