All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time

Timothy M. Chan, Dimitrios Skrepetos. All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time. In Seok-Hee Hong, editor, 27th International Symposium on Algorithms and Computation, ISAAC 2016, December 12-14, 2016, Sydney, Australia. Volume 64 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.