Three-fast-searchable graphs (Q2446838)

From MaRDI portal
Revision as of 16:39, 4 August 2023 by Importer (talk | contribs) (‎Created a new 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

    Three-fast-searchable graphs (English)
    0 references
    0 references
    0 references
    0 references
    22 April 2014
    0 references
    computational complexity
    0 references
    fast searching
    0 references
    graph searching
    0 references

    Identifiers