Binary search in graphs revisited (Q1741841)

From MaRDI portal
Revision as of 04:54, 19 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
Binary search in graphs revisited
scientific article

    Statements

    title
    Binary search in graphs revisited (English)
    0 references
    author
    Argyrios Deligkas
    0 references
    George B. Mertzios
    0 references
    Paul G. Spirakis
    0 references
    published in
    Algorithmica
    0 references
    publication date
    7 May 2019
    0 references
    zbMATH DE Number
    7051762
    0 references
    zbMATH Keywords
    binary search
    0 references
    graph
    0 references
    approximate query
    0 references
    probabilistic algorithm
    0 references
    lower bound
    0 references
    OpenAlex ID
    W2594084810
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1741841&oldid=36490792"
    Powered by MediaWiki