SSSP runs in O(n 2^α(n) log² n) expected time for arbitrary pseudodisk graphs and diameter up to additive error 2 in Õ(n^{2-1/14}) time.
20 Mark de Berg, Bart M
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs
SSSP runs in O(n 2^α(n) log² n) expected time for arbitrary pseudodisk graphs and diameter up to additive error 2 in Õ(n^{2-1/14}) time.