Well-Quasi-Orderings and the Robertson–Seymour Theorems

Autor:	Michael R. Fellows, Rodney G. Downey
Rok vydání:	2013
Předmět:	Discrete mathematics symbols.namesake Machine description Computer science Section (archaeology) Parse tree symbols Interval graph Tree decomposition Planar graph
Zdroj:	Texts in Computer Science ISBN: 9781447155584
DOI:	10.1007/978-1-4471-5559-1_17
Popis:	As we will see, well-quasi-orderings (WQOs) provide a powerful engine for demonstrating that classes of problems are FPT. In the next section, we will look at the rudiments of the theory of WQOs, and in subsequent sections, we will examine applications to combinatorial problems.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::98f4f40b4ceb5535921b329527142dab https://doi.org/10.1007/978-1-4471-5559-1_17 Zobrazit plný text záznamu