Non-crossing shortest paths lengths in planar graphs in linear time (Q6153472)

From MaRDI portal
scientific article; zbMATH DE number 7804726
Language Label Description Also known as
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
    0 references
    0 references
    14 February 2024
    0 references
    shortest paths
    0 references
    undirected planar graphs
    0 references
    non-crossing paths
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references