DeepAI

# Computing Lengths of Shortest Non-Crossing Paths in Planar Graphs

Given a plane undirected graph G with non-negative edge weights and a set of k terminal pairs on the external face, it is shown in Takahashi et al., (Algorithmica, 16, 1996, pp. 339-357) that the lengths of k non-crossing shortest paths joining the k terminal pairs (if they exist) can be computed in O(n log n) worst-case time, where n is the number of vertices of G. This technique only applies when the union U of the computed shortest paths is a forest. We show that given a plane undirected weighted graph U and a set of k terminal pairs on the external face, it is always possible to compute the lengths of k non-crossing shortest paths joining the k terminal pairs in linear worst-case time, provided that the graph U is the union of k shortest paths, possibly containing cycles. Moreover, each shortest path π can be listed in O(ℓ+ℓlog⌈k/ℓ⌉), where ℓ is the number of edges in π. As a consequence, the problem of computing multi-terminal distances in a plane undirected weighted graph can always be solved in O(n log k) worst-case time.

10/24/2022

### Non-Crossing Shortest Paths are Covered with Exactly Four Forests

Given a set of paths P we define the Path Covering with Forest Number of...
02/22/2021

### Multi-Terminal Shortest Paths in Unit-Weight Planar Graphs in Linear Time

Given a set of terminal pairs on the external face of a planar graph wit...
04/30/2018

### The idemetric property: when most distances are (almost) the same

We introduce the idemetric property, which formalises the idea that most...
09/11/2018

### The Undirected Two Disjoint Shortest Paths Problem

The k disjoint shortest paths problem (k-DSPP) on a graph with k source-...
03/17/2021

### Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs

We consider the problem of computing shortest paths in weighted unit-dis...
05/16/2018

### Wireless coverage prediction via parametric shortest paths

When deciding where to place access points in a wireless network, it is ...
07/15/2020

### Directed Shortest Paths via Approximate Cost Balancing

We present an O(nm) algorithm for all-pairs shortest paths computations ...