First Page | Document Content | |
---|---|---|
Date: 2007-10-28 15:28:40NP-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 2007Add to Reading ListSource URL: www.cs.cornell.eduDownload Document from Source WebsiteFile Size: 53,50 KBShare Document on Facebook |