A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity (Q4210095)

From MaRDI portal
Revision as of 13:56, 6 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 1200727
Language Label Description Also known as
English
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
scientific article; zbMATH DE number 1200727

    Statements

    A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 September 1998
    0 references
    connectivity
    0 references
    reachability
    0 references
    time-space tradeoff
    0 references
    polynomial time algorithm
    0 references
    path
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references