Advertisement
Published in:
1999 | OriginalPaper | Chapter
Well-Quasi-Orderings and the Robertson-Seymour Theorems
Authors : R. G. Downey, M. R. Fellows
Published in: Parameterized Complexity
Publisher: Springer New York
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
As we will see, well-quasi-orderings (WQO’s) provide a powerful engine for demonstrating that classes of problems are FPT. In this section, we will look at the rudiments of the theory of WQO’s, and in subsequent sections, we will examine applications to combinatorial problems.