<--- Back to Details
First PageDocument Content
Graph theory / Mathematics / NP-complete problems / NP-hard problems / Graph coloring / Routing algorithms / Search algorithms / Hamiltonian path / Bipartite graph / Travelling salesman problem / A* search algorithm / Planar separator theorem
Date: 2010-06-13 16:41:26
Graph theory
Mathematics
NP-complete problems
NP-hard problems
Graph coloring
Routing algorithms
Search algorithms
Hamiltonian path
Bipartite graph
Travelling salesman problem
A* search algorithm
Planar separator theorem

DISCRETE APPLIED MATHEMATICS ELSEYIER Discrete Applied

Add to Reading List

Source URL: www.maths.lse.ac.uk

Download Document from Source Website

File Size: 1,10 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