Edge and node searching problems on trees (Q1575444)

From MaRDI portal
Revision as of 13:12, 30 May 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
Edge and node searching problems on trees
scientific article

    Statements

    title
    Edge and node searching problems on trees (English)
    0 references
    author
    N. Delaunay
    0 references
    publication date
    21 August 2000
    0 references
    zbMATH DE Number
    1493309
    0 references
    zbMATH Keywords
    algorithm
    0 references
    edge searching
    0 references
    node searching
    0 references
    pathwidth
    0 references
    tree
    0 references
    cites work
    Q4035355
    0 references
    Q3199182
    0 references
    Q3351169
    0 references
    Q3829586
    0 references
    Searching and pebbling
    0 references
    Topological Bandwidth
    0 references
    Q3477966
    0 references
    Q4159394
    0 references
    Q3208679
    0 references
    Q3666632
    0 references
    Q3475289
    0 references
    Q3197842
    0 references
    Q4027193
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1575444&oldid=34250623"
    Powered by MediaWiki