The computational complexity of optimal blocking of vertices in the digraph (Q5151321)

From MaRDI portal
scientific article; zbMATH DE number 7311865
Language Label Description Also known as
English
The computational complexity of optimal blocking of vertices in the digraph
scientific article; zbMATH DE number 7311865

    Statements

    The computational complexity of optimal blocking of vertices in the digraph (English)
    0 references
    17 February 2021
    0 references
    digraph
    0 references
    Ford-Fulkerson theorem
    0 references
    optimal blocking
    0 references
    computational complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references