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 |