Computing the shortest essential cycle (Q603870)

From MaRDI portal
Revision as of 21:04, 1 July 2023 by Importer (talk | contribs) (‎Created a new 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

    Computing the shortest essential cycle (English)
    0 references
    0 references
    0 references
    8 November 2010
    0 references
    computational topology
    0 references
    topological graph theory
    0 references
    combinatorial surface
    0 references
    essential cycles
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references