Sandwich and probe problems for excluding paths
Abstract
Let Pk denote an induced path on k vertices. For k ≥ 5, we show that the Pk-free sandwich problem, partitioned probe problem, and unpartitioned probe problem are NP-complete. For k ≤ 4, it is known that the Pk-free sandwich problem, partitioned probe problem, and unpartitioned probe problem are in P.
Collections
Cite this version of the work
Celina Miraglia Herrera de Figueiredo, Sophie Spirkl
(2018).
Sandwich and probe problems for excluding paths. UWSpace.
http://hdl.handle.net/10012/18596
Other formats
The following license files are associated with this item:
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 International