<--- Back to Details
First PageDocument Content
Network theory / Shortest path problem / Min-plus matrix multiplication / Algorithm / Routing algorithms / Widest path problem / Floyd–Warshall algorithm / Graph theory / Mathematics / Theoretical computer science
Date: 2008-08-20 17:25:20
Network theory
Shortest path problem
Min-plus matrix multiplication
Algorithm
Routing algorithms
Widest path problem
Floyd–Warshall algorithm
Graph theory
Mathematics
Theoretical computer science

Add to Reading List

Source URL: www.cs.cmu.edu

Download Document from Source Website

File Size: 676,13 KB

Share Document on Facebook

Similar Documents

Dynamic programming / Binary operations / Primitive types / Approximate string matching / Pattern matching / Matrix / Multiplication / Factorial / Min-plus matrix multiplication / Mathematics / Abstract algebra / Data types

Fast distance multiplication of unit-Monge matrices Alexander Tiskin Department of Computer Science University of Warwick http://www.dcs.warwick.ac.uk/~tiskin

DocID: 14eOz - View Document

Routing algorithms / Network theory / Shortest path problem / Floyd–Warshall algorithm / Bellman–Ford algorithm / Min-plus matrix multiplication / Edge disjoint shortest pair algorithm / Mathematics / Theoretical computer science / Graph theory

IEOR 266 Lecture 12

DocID: 1EK5 - View Document

Network theory / Shortest path problem / Min-plus matrix multiplication / Algorithm / Routing algorithms / Widest path problem / Floyd–Warshall algorithm / Graph theory / Mathematics / Theoretical computer science

PDF Document

DocID: 175P - View Document