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

From MaRDI portal
Revision as of 22:40, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/jacm/MoylesT69, #quickstatements; #temporary_batch_1731530891435)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    title
    An Algorithm for Finding a Minimum Equivalent Graph of a Digraph (English)
    0 references
    author
    D. M. Moyles
    0 references
    Gerald L. Thompson
    0 references
    publication date
    1969
    0 references
    zbMATH Keywords
    topology
    0 references

    Identifiers

    DOI
    10.1145/321526.321534
    0 references
    zbMATH DE Number
    3294300
    0 references
    Wikidata QID
    Q56699884
    0 references
    OpenAlex ID
    W2076447414
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5576821&oldid=37911106"
    Powered by MediaWiki