Sciweavers

JEA
2010
94views more  JEA 2010»
12 years 11 months ago
Layer-free upward crossing minimization
An upward drawing of a DAG G is a drawing of G in which all edges are drawn as curves increasing monotonically in the vertical direction. In this paper, we present a new approach f...
Markus Chimani, Carsten Gutwenger, Petra Mutzel, H...
JEA
2010
95views more  JEA 2010»
13 years 3 months ago
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
In recent years, highly effective hierarchical and goal-directed speedup techniques for routing in large road networks have been developed. This paper makes a systematic study of ...
Reinhard Bauer, Daniel Delling, Peter Sanders, Den...