An Algorithm for Finding a Minimum Equivalent Graph of a Digraph (Q5576821)

From MaRDI portal
Revision as of 22:08, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article; zbMATH DE number 3294300
Language Label Description Also known as
English
An Algorithm for Finding a Minimum Equivalent Graph of a Digraph
scientific article; zbMATH DE number 3294300

    Statements

    An Algorithm for Finding a Minimum Equivalent Graph of a Digraph (English)
    0 references
    0 references
    0 references
    1969
    0 references
    topology
    0 references

    Identifiers