Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor

The notion of Turing kernelization investigates whether a polynomial-time algorithm can solve an NP-hard problem, when it is aided by an oracle that can be queried for the answers to bounded-size subproblems. One of the main open problems in this direction is whether k - Path admits a polynomial Tur...

Celý popis

Podrobná bibliografia

Vydané v:	Algorithmica Ročník 81; číslo 10; s. 3936 - 3967
Hlavní autori:	Jansen, Bart M. P., Pilipczuk, Marcin, Wrochna, Marcin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.10.2019 Springer Nature B.V
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Deletion Kernels Mathematics of Computing Polynomials Special Issue: Parameterized and Exact Computation Theory of Computation Topology path Graph minors decomposition Turing kernelization
ISSN:	0178-4617, 1432-0541
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!