Approximate search strategies for weighted trees (Q1929222)

From MaRDI portal
Revision as of 02:20, 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
Approximate search strategies for weighted trees
scientific article

    Statements

    title
    Approximate search strategies for weighted trees (English)
    0 references
    publication date
    7 January 2013
    0 references
    Mathematics Subject Classification ID
    05C85
    0 references
    68W25
    0 references
    91A43
    0 references
    05C22
    0 references
    05C05
    0 references
    zbMATH DE Number
    6122459
    0 references
    zbMATH Keywords
    connected searching
    0 references
    edge searching
    0 references
    graph searching
    0 references
    node searching
    0 references
    pathwidth
    0 references
    OpenAlex ID
    W2033462251
    0 references
    cites work
    Q4035355
    0 references
    Q3113706
    0 references
    Searching and pebbling
    0 references
    Q3477966
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1929222&oldid=35316059"
    Powered by MediaWiki