Geometric speed-up techniques for finding shortest paths in large sparse graphs (2003)
Dorothea Wagner, Thomas Willhalm, D. Wagner, T. Willhalm
In this paper, we consider Dijkstra’s algorithm for the single source single target shortest paths problem in large sparse graphs. The goal is to reduce the response time for online queries by...
Visualization of bibliographic networks with a reshaped landscape metaphor (2002)
Ulrik Brandes, Thomas Willhalm, Fachbereich Informatik Und Informationswissenschaft, U. Br, T. Willhalm
We describe a novel approach to visualize bibliographic networks that facilitates the simultaneous identification of clusters (e.g., topic areas) and prominent entities (e.g., surveys or landmark...
Abstract Visualization of Bibliographic Networks with a Reshaped Landscape Metaphor (2002)
Ulrik Brandes, Thomas Willhalm, U. Br, T. Willhalm
We describe a novel approach to visualize bibliographic networks that facilitates the simultaneous identification of clusters (e.g., topic areas) and prominent entities (e.g., surveys or landmark...
Visualization of Bibliographic Networks with a Reshaped Landscape Metaphor (2002)
We describe a novel approach to visualize bibliographic networks that facilitates the simultaneous identification of clusters (e.g., topic areas) and prominent entities (e.g., surveys or landmark...