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

From MaRDI portal
Revision as of 15:35, 5 June 2024 by ReferenceBot (talk | contribs) (‎Changed an 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

    title
    An O\((n\log n)\) algorithm for the zoo-keeper's problem (English)
    0 references
    publication date
    28 April 2003
    0 references
    zbMATH DE Number
    1902831
    0 references
    zbMATH Keywords
    shortest paths
    0 references
    zoo-keeper's problem
    0 references
    floodlight tree
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1869741&oldid=34338784"
    Powered by MediaWiki