<--- Back to Details
First PageDocument Content
Routing algorithms / Operations research / NP-complete problems / Matching / Color-coding / Connectivity / Travelling salesman problem / Graph / Dynamic programming / Graph theory / Mathematics / Theoretical computer science
Date: 2006-03-25 14:27:44
Routing algorithms
Operations research
NP-complete problems
Matching
Color-coding
Connectivity
Travelling salesman problem
Graph
Dynamic programming
Graph theory
Mathematics
Theoretical computer science

Add to Reading List

Source URL: people.csail.mit.edu

Download Document from Source Website

File Size: 2,53 MB

Share Document on Facebook

Similar Documents

Edsger W. Dijkstra / Network theory / Shortest path problem / Constructible universe / Total least squares

Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook

DocID: 1xVkB - View Document

PDF Document

DocID: 1xkJU - View Document

Graph theory Po-Shen Loh June

DocID: 1vmTo - View Document

Graph theory Po-Shen Loh June

DocID: 1vhpu - View Document

Graph theory Po-Shen Loh June

DocID: 1v8nl - View Document