First Page | Document Content | |
---|---|---|
Date: 2011-04-27 05:27:10Graph theory Graph coloring NP-complete problems Matroid theory Graph Matching Ear decomposition Pathwidth Independent set | Finding Common Structured Patterns in Linear Graphs ? Guillaume Fertin LINA, CNRS UMR 6241, UniversitĀ“e de Nantes, 2 rue de la Houssini`ere, 44322 Nantes, FranceAdd to Reading ListSource URL: pagesperso.lina.univ-nantes.frDownload Document from Source WebsiteFile Size: 265,68 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 |