<--- 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

Routing protocols / Routing algorithms / Network theory / Routing / Border Gateway Protocol / Shortest path problem / Link-state routing protocol / Contraction hierarchies

Distributed Computing manuscript No. (will be inserted by the editor) Joan Feigenbaum · Rahul Sami · Scott Shenker Mechanism Design for Policy Routing

DocID: 1oZA5 - 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

Search algorithms / Network theory / Game artificial intelligence / Routing algorithms / Shortest path problem / Breadth-first search / Contraction hierarchies / A* search algorithm / Graph / Mathematics / Graph theory / Theoretical computer science

A Comparison of High-Level Approaches for Speeding Up Pathfinding Nathan R. Sturtevant1 Robert Geisberger Department of Computing Science

DocID: V3lu - View Document

Network theory / Shortest path problem / Centrality / Flow network / Edge contraction / Graph / Bridge / Contraction hierarchies / Tree / Graph theory / Mathematics / Theoretical computer science

Untitled

DocID: jbG - View Document