Computing the shortest essential cycle (Q603870)

From MaRDI portal
Revision as of 10:27, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing the shortest essential cycle
scientific article

    Statements

    title
    Computing the shortest essential cycle (English)
    0 references
    author
    Jeff Erickson
    0 references
    Pratik Worah
    0 references
    publication date
    8 November 2010
    0 references
    zbMATH Keywords
    computational topology
    0 references
    topological graph theory
    0 references
    combinatorial surface
    0 references
    essential cycles
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68U05
    0 references
    05C38
    0 references
    68R10
    0 references
    68Q17
    0 references
    zbMATH DE Number
    5813756
    0 references
    OpenAlex ID
    W2102559438
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q603870&oldid=35199031"
    Powered by MediaWiki