<--- Back to Details
First PageDocument Content
Network theory / Routing algorithms / Edsger W. Dijkstra / Graph theory / Shortest path problem / Distance oracle / Routing / Flow network / Contraction hierarchies / K shortest path routing
Date: 2012-06-06 03:08:31
Network theory
Routing algorithms
Edsger W. Dijkstra
Graph theory
Shortest path problem
Distance oracle
Routing
Flow network
Contraction hierarchies
K shortest path routing

Add to Reading List

Source URL: www.cs.ucsb.edu

Download Document from Source Website

File Size: 324,63 KB

Share Document on Facebook

Similar Documents

Network theory / Routing algorithms / Edsger W. Dijkstra / Graph connectivity / NP-complete problems / Shortest path problem / Distance / Path / Longest path problem / K shortest path routing / FloydWarshall algorithm

Disambiguating Road Names in Text Route Descriptions using Exact-All-Hop Shortest Path Algorithm Xiao Zhang⋆ △ and Baojun Qiu⋆⋄ and Prasenjit Mitra⋆† and Sen Xu‡ and Alexander Klippel‡ and Alan M. MacEach

DocID: 1pqLy - View Document

Graph theory / Mathematics / Routing algorithms / Network theory / Edsger W. Dijkstra / Shortest path problem / Dynamic programming / Edge disjoint shortest pair algorithm / K shortest path routing

Fast A3 Algorithms for Multiple Sequence Alignment Takahiro Ikeda Hiroshi Imai

DocID: 1lJxM - View Document

Graph theory / Mathematics / Combinatorial optimization / Edsger W. Dijkstra / Routing algorithms / Search algorithms / Graph traversal / Shortest path problem / A* search algorithm / Directed graph / Matching / Connectivity

Directed Graph Exploration Klaus-Tycho Foerster and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {k-t.foerster,wattenhofer}@tik.ee.ethz.ch

DocID: 1lz9X - View Document

Network theory / Routing algorithms / Edsger W. Dijkstra / Graph theory / Shortest path problem / Distance oracle / Routing / Flow network / Contraction hierarchies / K shortest path routing

PDF Document

DocID: 1iRRS - View Document

Throughput / Routing / Latency / Shortest path problem / Computing / Theoretical computer science / Network performance / Mathematics

GOAL: A Load-Balanced Adaptive Routing Algorithm for Torus Networks ∗ Arjun Singh , William J Dally , Amit K Gupta , Brian Towles Computer Systems Laboratory Stanford University {arjuns, billd, agupta, btowles}@cva.sta

DocID: 13OZ5 - View Document