An O\((n\log n)\) algorithm for the zoo-keeper's problem (Q1869741)

From MaRDI portal
Revision as of 15:24, 28 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An O\((n\log n)\) algorithm for the zoo-keeper's problem
scientific article

    Statements

    An O\((n\log n)\) algorithm for the zoo-keeper's problem (English)
    0 references
    28 April 2003
    0 references
    shortest paths
    0 references
    zoo-keeper's problem
    0 references
    floodlight tree
    0 references

    Identifiers