The complexity of determining a shortest cycle of even length (Q1052821)

From MaRDI portal
Revision as of 10:30, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of determining a shortest cycle of even length
scientific article

    Statements

    title
    The complexity of determining a shortest cycle of even length (English)
    0 references
    author
    Burkhard Monien
    0 references
    published in
    Computing
    0 references
    publication date
    1983
    0 references
    zbMATH Keywords
    shortest cycle
    0 references
    efficient algorithms
    0 references

    Identifiers

    DOI
    10.1007/BF02251238
    0 references
    zbMATH DE Number
    3817044
    0 references
    OpenAlex ID
    W146202307
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1052821&oldid=37289617"
    Powered by MediaWiki