Topologically trivial closed walks in directed surface graphs
From MaRDI portal
Publication:5088964
Recommendations
- Topologically trivial closed walks in directed surface graphs
- Finding shortest non-trivial cycles in directed graphs on surfaces
- Shortest non-trivial cycles in directed and undirected surface graphs
- Finding shortest non-trivial cycles in directed graphs on surfaces
- Shortest non-trivial cycles in directed surface graphs
Cites work
- scientific article; zbMATH DE number 5506235 (Why is no real title available?)
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- scientific article; zbMATH DE number 2079390 (Why is no real title available?)
- scientific article; zbMATH DE number 6850341 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 6783459 (Why is no real title available?)
- A Semiring on Convex Polygons and Zero-Sum Cycle Problems
- A note on curvature and fundamental group
- Computational topology. An introduction
- Curves von 2-manifolds and isotopies
- Detecting weakly simple polygons
- Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
- Embeddings of graphs with no short noncontractible cycles
- Finding cycles with topological properties in embedded graphs
- Finding one tight cycle
- Finding shortest contractible and shortest separating cycles in embedded graphs
- Finding shortest non-separating and non-contractible cycles for topologically embedded graphs
- Finding shortest non-trivial cycles in directed graphs on surfaces
- Finding shortest non-trivial cycles in directed graphs on surfaces
- Finding the closed partition of a planar graph
- Formal-Language-Constrained Path Problems
- Graphs on surfaces
- Graphs, surfaces and homology
- Groups, the theory of ends, and context-free languages
- Growth functions on Fuchsian groups and the Euler characteristic
- Holiest minimum-cost paths and flows in surface graphs
- Intersections of curves on surfaces
- Labeled shortest paths in digraphs with negative and positive edge weights
- Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components
- Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees
- Minimum cuts and shortest homologous cycles
- Multiple-source shortest paths in embedded graphs
- On problems related to growth, entropy, and spectrum in group theory
- Optimally cutting a surface into a disk
- Papers on group theory and topology. Translated and introduced by John Stillwell
- Shortest non-trivial cycles in directed and undirected surface graphs
- Shortest non-trivial cycles in directed surface graphs
- Small cancellation theory and automatic groups
- Splitting (complicated) surfaces is hard
- Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs
- Tightening nonsimple paths and cycles on surfaces
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
- Transforming curves on surfaces
- Transforming curves on surfaces redux
This page was built for publication: Topologically trivial closed walks in directed surface graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088964)
