First Page | Document Content | |
---|---|---|
Date: 2010-06-13 16:41:26Graph 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 AppliedAdd to Reading ListSource URL: www.maths.lse.ac.ukDownload Document from Source WebsiteFile Size: 1,10 MBShare Document on Facebook |
Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. CookDocID: 1xVkB - View Document | |
PDF DocumentDocID: 1xkJU - View Document | |
Graph theory Po-Shen Loh JuneDocID: 1vmTo - View Document | |
Graph theory Po-Shen Loh JuneDocID: 1vhpu - View Document | |
Graph theory Po-Shen Loh JuneDocID: 1v8nl - View Document |