![Minor / Path decomposition / Tree decomposition / Bidimensionality / Edge contraction / Clique-sum / Robertson–Seymour theorem / Apex graph / Planar graph / Graph theory / Theoretical computer science / Graph operations Minor / Path decomposition / Tree decomposition / Bidimensionality / Edge contraction / Clique-sum / Robertson–Seymour theorem / Apex graph / Planar graph / Graph theory / Theoretical computer science / Graph operations](https://www.pdfsearch.io/img/33e839793a8e22a7a3146e6df59e5b42.jpg)
| Document Date: 2010-03-02 04:30:56 Open Document File Size: 196,60 KBShare Result on Facebook
City Athens / Bergen / / Company G. / / Country Norway / Greece / / / Facility University of Bergen / University of Athens / Kapodistrian University of Athens / / IndustryTerm important technical tool / subexponential algorithms / well known polynomial time algorithm / subexponential parameterized algorithms / approximation algorithms / / Organization Norwegian Research Council / Department of Mathematics / Department of Informatics / University of Athens / University of Bergen / / Position author / salesman / or various distance modification problems / Prime Minister / / Product k + 8 / Excluded Minor Theorem / / PublishedMedium the National / / Technology subexponential parameterized algorithms / well known polynomial time algorithm / approximation algorithms / / URL http /
SocialTag |