On computing the 2-vertex-connected components of directed graphs (Q266828)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On computing the 2-vertex-connected components of directed graphs
scientific article

    Statements

    On computing the 2-vertex-connected components of directed graphs (English)
    0 references
    0 references
    7 April 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    2-vertex-connected components
    0 references
    strong articulation points
    0 references
    approximation algorithms
    0 references
    0 references
    0 references