Recommendations
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
- scientific article; zbMATH DE number 1522940
- k-pairs non-crossing shortest paths in a simple polygon
- k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON
- Finding a noncrossing Steiner forest in plane graphs under a 2-face condition
Cited in
(16)- Shortest enclosing walks and cycles in embedded graphs
- Non-crossing shortest paths in undirected unweighted planar graphs in linear time
- Thick non-crossing paths in a polygonal domain
- Minimum cuts and shortest cycles in directed planar graphs via noncrossing shortest paths
- Computing the Fréchet distance between polygons with holes
- Irrelevant vertices for the planar disjoint paths problem
- scientific article; zbMATH DE number 1522940 (Why is no real title available?)
- k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON
- Non-crossing connectors in the plane
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
- Finding a noncrossing Steiner forest in plane graphs under a 2-face condition
- Non-crossing shortest paths lengths in planar graphs in linear time
- Non-crossing shortest paths lengths in planar graphs in linear time
- k-pairs non-crossing shortest paths in a simple polygon
- A (5/3+)-approximation for tricolored non-crossing Euclidean TSP
- Shortest path separators in unit disk graphs
This page was built for publication: Shortest non-crossing walks in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365044)
