scientific article; zbMATH DE number 7559234
From MaRDI portal
Publication:5088964
DOI10.4230/LIPIcs.SoCG.2019.34MaRDI QIDQ5088964
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
homologycontext-free grammarshyperbolic geometryhomotopystrong connectivitycomputational topologymedial axessurface-embedded graphs
Related Items (1)
Cites Work
- Small cancellation theory and automatic groups
- Groups, the theory of ends, and context-free languages
- Finding shortest non-separating and non-contractible cycles for topologically embedded graphs
- Embeddings of graphs with no short noncontractible cycles
- Splitting (complicated) surfaces is hard
- Intersections of curves on surfaces
- Growth functions on Fuchsian groups and the Euler characteristic
- Transforming curves on surfaces
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
- Finding the closed partition of a planar graph
- Optimally cutting a surface into a disk
- On problems related to growth, entropy, and spectrum in group theory
- Curves von 2-manifolds and isotopies
- A note on curvature and fundamental group
- Multiple-Source Shortest Paths in Embedded Graphs
- Finding shortest non-trivial cycles in directed graphs on surfaces
- Finding Cycles with Topological Properties in Embedded Graphs
- A Semiring on Convex Polygons and Zero-Sum Cycle Problems
- Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
- Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components
- Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees
- Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs
- Formal-Language-Constrained Path Problems
- Holiest minimum-cost paths and flows in surface graphs
- Labeled shortest paths in digraphs with negative and positive edge weights
- Detecting Weakly Simple Polygons
- Minimum cuts and shortest homologous cycles
- Tightening Nonsimple Paths and Cycles on Surfaces
- Shortest non-trivial cycles in directed surface graphs
- Finding shortest non-trivial cycles in directed graphs on surfaces
- Shortest Non-trivial Cycles in Directed and Undirected Surface Graphs
- Transforming Curves on Surfaces Redux
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
