First Page | Document Content | |
---|---|---|
Date: 2014-10-02 11:19:31NP-complete problems Graph Graph theory Matching Cycle Hamiltonian path Spanning tree | Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles Oliver Schaudt Institut f¨ ur Informatik, Universit¨at zu K¨oln, K¨oln, GermanyAdd to Reading ListSource URL: www.zaik.uni-koeln.deDownload Document from Source WebsiteFile Size: 402,91 KBShare 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 |