<--- Back to Details
First PageDocument Content
NP-complete problems / Travelling salesman problem / Matching / Eulerian path / Hamiltonian path / Christofides algorithm / Connectivity / Graph / Graph theory / Mathematics / Theoretical computer science
Date: 2007-10-28 15:28:40
NP-complete problems
Travelling salesman problem
Matching
Eulerian path
Hamiltonian path
Christofides algorithm
Connectivity
Graph
Graph theory
Mathematics
Theoretical computer science

Design and Analysis of Algorithms CS681 Fall 2007

Add to Reading List

Source URL: www.cs.cornell.edu

Download Document from Source Website

File Size: 53,50 KB

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