<--- Back to Details
First PageDocument Content
Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Hamiltonian path / Eulerian path / Travelling salesman problem / Cycle / Seven Bridges of Knigsberg / Path / NP-completeness / Shortest path problem
Date: 2012-03-26 04:52:47
Graph theory
Mathematics
Computational complexity theory
NP-complete problems
Hamiltonian path
Eulerian path
Travelling salesman problem
Cycle
Seven Bridges of Knigsberg
Path
NP-completeness
Shortest path problem

CS681: Advanced Topics in Computational Biology Week 7 Lectures 2-3 Can Alkan EA224

Add to Reading List

Source URL: www.cs.bilkent.edu.tr

Download Document from Source Website

File Size: 1,20 MB

Share Document on Facebook

Similar Documents

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

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

Graph theory Po-Shen Loh June

DocID: 1vmTo - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1vhpu - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1v8nl - View Document