The best choice problem for upward directed graphs (Q1926501)

From MaRDI portal
Revision as of 01:19, 6 July 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
The best choice problem for upward directed graphs
scientific article

    Statements

    title
    The best choice problem for upward directed graphs (English)
    0 references
    publication date
    28 December 2012
    0 references
    zbMATH DE Number
    6119007
    0 references
    zbMATH Keywords
    directed graph
    0 references
    secretary problem
    0 references
    best choice
    0 references
    universal algorithm
    0 references
    OpenAlex ID
    W1995704185
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1926501&oldid=35314151"
    Powered by MediaWiki