An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs (Q4015475)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs
scientific article

    Statements

    An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs (English)
    0 references
    0 references
    5 January 1993
    0 references
    randomized algorithm
    0 references
    maximum-flow maximum-cut
    0 references
    connected random graphs
    0 references
    NP-hard communication problem
    0 references
    sublogarithmic parallel and distributed implementation
    0 references

    Identifiers

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