All-Pairs Shortest Paths in Geometric Intersection Graphs
$\newcommand{\OO}[1]{O\left(#1\right)}$We present a simple and general algorithm for the all-pairs shortest paths (APSP) problem in unweighted geometric intersection graphs. Specifically we reduce the problem to the design of static data structures for offline intersection detection. Consequently w...
Сохранить в:
| Главные авторы: | , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
Carleton University
2019-02-01
|
| Серии: | Journal of Computational Geometry |
| Online-ссылка: | https://jocg.org/index.php/jocg/article/view/3068 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|