Finding kth paths and p-centers by generating and searching good data structures (Q4747524)

From MaRDI portal
Revision as of 21:04, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3804863
Language Label Description Also known as
English
Finding kth paths and p-centers by generating and searching good data structures
scientific article; zbMATH DE number 3804863

    Statements

    Finding kth paths and p-centers by generating and searching good data structures (English)
    0 references
    0 references
    0 references
    1983
    0 references
    representation of the set of intervertex distances of a tree
    0 references
    path selection
    0 references
    p-center location
    0 references
    networks with independent cycles
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references