A New Algorithm for Computing the Maximal Closure of a Graph (Q3491289)

From MaRDI portal
Revision as of 11:29, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A New Algorithm for Computing the Maximal Closure of a Graph
scientific article

    Statements

    A New Algorithm for Computing the Maximal Closure of a Graph (English)
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    directed graph
    0 references
    maximal closure problem
    0 references
    equivalent maximal flow problem
    0 references

    Identifiers

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