Shortest paths in Euclidean graphs
Algorithmica
An algorithm for drawing general undirected graphs
Information Processing Letters
Fixed edge-length graph drawing is NP-hard
Discrete Applied Mathematics
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
Graph drawing by force-directed placement
Software—Practice & Experience
Drawing graphs nicely using simulated annealing
ACM Transactions on Graphics (TOG)
Matrix computations (3rd ed.)
LAPACK Users' guide (third ed.)
LAPACK Users' guide (third ed.)
Dijkstra's algorithm on-line: an empirical case study from public railroad transport
Journal of Experimental Algorithmics (JEA)
Path Computation Algorithms for Advanced Traveller Information System (ATIS)
Proceedings of the Ninth International Conference on Data Engineering
HiTi Graph Model of Topographical Roadmaps in Navigation Systems
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Using Multi-level Graphs for Timetable Information in Railway Systems
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
3D Graph Drawing with Simulated Annealing
GD '95 Proceedings of the Symposium on Graph Drawing
JIGGLE: Java Interactive Graph Layout Environment
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
| Hi-index | 0.00 |
Speed-up techniques that exploit given node coordinates have proven useful for shortest-path computations in transportation networks and geographic information systems. To facilitate the use of such techniques when coordinates are missing from some, or even all, of the nodes in a network we generate artificial coordinates using methods from graph drawing. Experiments on a large set of German train timetables indicate that the speed-up achieved with coordinates from our drawings is close to that achieved with the true coordinates---and in some special cases even better.