![Graph theory / Graph coloring / NP-complete problems / Matroid theory / Graph / Matching / Ear decomposition / Pathwidth / Independent set Graph theory / Graph coloring / NP-complete problems / Matroid theory / Graph / Matching / Ear decomposition / Pathwidth / Independent set](https://www.pdfsearch.io/img/75756f6732e10a5c0fe56c33875a91fe.jpg) 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 Website File Size: 265,68 KBShare Document on Facebook
|