Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time (2102.10892v2)

Published 22 Feb 2021 in cs.DS

Abstract: Given a set of well-formed terminal pairs on the external face of an undirected planar graph with unit edge weights, we give a linear-time algorithm for computing the union of non-crossing shortest paths joining each terminal pair, where well-formed means that such a set of non-crossing paths exists. This allows us to compute distances between each terminal pair, within the same time bound. We also give a novel concept of incremental shortest path subgraph of a planar graph, i.e., a partition of the planar embedding in subregions that preserve distances, that can be of interest itself.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Lorenzo Balzotti (8 papers)
  2. Paolo G. Franciosa (7 papers)
Citations (6)

Summary

We haven't generated a summary for this paper yet.