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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Panoramic View of Riemannian Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly removing g handles at once / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many distances in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding shortest non-separating and non-contractible cycles for topologically embedded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting (complicated) surfaces is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cuts and shortest homologous cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Singular Lagrangian manifolds and semiclassical analysis. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tightening non-simple paths and cycles on surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal pants decompositions and shortest homotopic cycles on an orientable surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally cutting a surface into a disk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of Train Tracks. (AM-125) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster shortest-path algorithms for planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3602875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a canonical polygonal schema of an orientable triangulated surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching is as easy as matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embeddings of graphs with no short noncontractible cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology for Computing / rank
 
Normal rank

Latest revision as of 11:27, 3 July 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
    0 references
    0 references
    0 references
    0 references
    0 references
    computational topology
    0 references
    topological graph theory
    0 references
    combinatorial surface
    0 references
    essential cycles
    0 references
    0 references