<--- Back to Details
First PageDocument Content
Graph theory / Graph coloring / NP-complete problems / Matroid theory / Graph / Matching / Ear decomposition / Pathwidth / Independent set
Date: 2011-04-27 05:27:10
Graph 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, France

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Download Document from Source Website

File Size: 265,68 KB

Share Document on Facebook

Similar Documents