Finding shortest non-separating and non-contractible cycles for topologically embedded graphs
From MaRDI portal
Publication:878074
DOI10.1007/S00454-006-1292-5zbMATH Open1115.05019OpenAlexW1522210445MaRDI QIDQ878074FDOQ878074
Publication date: 26 April 2007
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-006-1292-5
Recommendations
Cited In (23)
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding
- Title not available (Why is that?)
- Topologically trivial closed walks in directed surface graphs
- Algorithms for the edge-width of an embedded graph
- Embeddings of graphs with no short noncontractible cycles
- Space complexity of perfect matching in bounded genus bipartite graphs
- Approximating the Crossing Number of Toroidal Graphs
- Computing the shortest essential cycle
- Three-coloring triangle-free graphs on surfaces. VI: 3-colorability of quadrangulations
- Title not available (Why is that?)
- Counting and sampling minimum cuts in genus \(g\) graphs
- Homomorphisms between graphs embedded in surfaces
- Title not available (Why is that?)
- Minimum Cuts in Surface Graphs
- Untangling two systems of noncrossing curves
- Algorithms – ESA 2005
- Compressed Decision Problems in Hyperbolic Groups.
- Discrete systolic inequalities and decompositions of triangulated surfaces
- Separating and nonseparating disjoint homotopic cycles in graph embeddings
- On Short Noncontractible Cycles in Embedded Graphs
- Approximation Algorithms for Euler Genus and Related Problems
- Finding short cycles in embedded graph in polynomial time
- Dynamic programming for graphs on surfaces
This page was built for publication: Finding shortest non-separating and non-contractible cycles for topologically embedded graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878074)
