Finding a Minimum Circuit in a Graph (Q4167596)

From MaRDI portal
Revision as of 02:08, 21 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q29041951, #quickstatements; #temporary_batch_1710982311091)
scientific article; zbMATH DE number 3601122
Language Label Description Also known as
English
Finding a Minimum Circuit in a Graph
scientific article; zbMATH DE number 3601122

    Statements

    title
    Finding a Minimum Circuit in a Graph (English)
    0 references
    author
    Alon Itai
    0 references
    Michael Rodeh
    0 references
    publication date
    1978
    0 references

    Identifiers

    DOI
    10.1137/0207033
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C35
    0 references
    05C38
    0 references
    68W99
    0 references
    68Q25
    0 references
    zbMATH DE Number
    3601122
    0 references
    OpenAlex ID
    W1991858502
    0 references
    Wikidata QID
    Q29041951
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4167596&oldid=33099732"
    Powered by MediaWiki