Three-fast-searchable graphs (Q2446838)

From MaRDI portal
Revision as of 10:03, 8 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
Three-fast-searchable graphs
scientific article

    Statements

    title
    Three-fast-searchable graphs (English)
    0 references
    author
    Dariusz Dereniowski
    0 references
    Öznur Yaşar Diner
    0 references
    Danny Dyer
    0 references
    publication date
    22 April 2014
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    fast searching
    0 references
    graph searching
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    68R10
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6287218
    0 references
    OpenAlex ID
    W2132813033
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2446838&oldid=35385097"
    Powered by MediaWiki