Date: 2008-11-28 02:18:19Graph theory Mathematics Discrete mathematics Routing algorithms Edsger W. Dijkstra Network theory Operations research Search algorithms Shortest path problem A* search algorithm Graph Node | | Routing by Landmarks Urs-Jakob Rüetschi, University of Zurich David Caduff, University of Zurich Frank Schulz, University of Karlsruhe Alexander Wolff, University of Karlsruhe Sabine Timpf, University of ZurichDocument is deleted from original location. Use the Download Button below to download from the Web Archive.Download Document from Web Archive File Size: 312,49 KB
|