Computing the shortest essential cycle (Q603870): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00454-010-9241-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2102559438 / rank
 
Normal rank

Revision as of 19:41, 19 March 2024

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
    0 references