Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs (2003)

by Dorothea Wagner , Thomas Willhalm
Citations:53 - 14 self

Document Versions

Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs –Dorothea Wagner, Thomas Willhalm — 2003
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs –Dorothea Wagner, Thomas Willhalm — 2003 — IN 11TH EUROPEAN SYMPOSIUM ON ALGORITHMS, VOLUME 2832 OF LNCS
Geometric speed-up techniques for finding shortest paths in large sparse graphs –Dorothea Wagner, Thomas Willhalm — 2003 — IN 11TH EUROPEAN SYMPOSIUM ON ALGORITHMS, VOLUME 2832 OF LNCS