7 citations · 11 across the 2 of their papers we have counts for
3 papers · 1 filter
Reconfiguration of graph minors
Benjamin Moore, Naomi Nishimura, Vijay Subramanya
Under the reconfiguration framework, we consider the various ways that a target graph is a {\em minor} of a host graph , where a subgraph of can be transformed into …
Reconfiguring spanning and induced subgraphs
Tesshu Hanaka, Takehiro Ito, Haruka Mizuta +5
Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertice…
Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor
Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna
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…