![Tree decomposition / Robertson–Seymour theorem / Minor / Planar graphs / Feedback vertex set / Forbidden graph characterization / Permutation graph / Tree / Graph / Graph theory / Graph operations / Path decomposition Tree decomposition / Robertson–Seymour theorem / Minor / Planar graphs / Feedback vertex set / Forbidden graph characterization / Permutation graph / Tree / Graph / Graph theory / Graph operations / Path decomposition](https://www.pdfsearch.io/img/ae1300c075b45769cae626b7e3e0a35c.jpg)
| Document Date: 2009-08-06 03:07:31 Open Document File Size: 721,12 KBShare Result on Facebook
City Victoria / Auckland / / Company Elsevier Science B.V. / VERTEX / / Country Canada / New Zealand / / / Facility University of Victoria / University of Auckland / / IndustryTerm heuristic algorithm / search trees / membership algorithm / linear-time algorithms / linear-time recognition algorithms / search theory / heuristic algorithms / nite-state search procedure / polynomial-time membership algorithm / linear-time algorithm / linear-time membership algorithm / treewidth search spaces / brute-force algorithm / broadcast-display networks / search space / bounded treewidth search / Membership algorithms / approximation algorithms / / Organization University of Victoria / Department of Computer Science / University of Auckland / / Person Michael R. Fellowsb / Kevin Cattellb / Michael J. Dinneena / Ty / / Position Corresponding author / / ProgrammingLanguage C++ / / ProvinceOrState British Columbia / Victoria / / Technology Membership algorithms / linear-time recognition algorithms / brute-force algorithm / linear-time algorithms / linear-time membership algorithm / one polynomial-time membership algorithm / pathwidth-based algorithms / membership algorithm / approximation algorithms / linear-time algorithm / / URL www.elsevier.com/locate/disc / /
SocialTag |