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
Related items
Showing items related by title, author, creator and subject.
-
Radiotherapy Cancer Treatment: Investigating Real-Time Position and Dose Control, the Sensor-Delayed Plant Output Estimation Problem, and the Nonovershooting Step Response Problem
Stewart, James (University of Waterloo, 2006-12-18)For over a century, physicians have prescribed x-ray radiation to destroy or impede the growth of cancerous tumours. Modern radiation therapy machines shape the radiation beam to balance the competing goals of maximizing ... -
A k-Conjugacy Class Problem
Roberts, Collin (University of Waterloo, 2007-09-07)In any group G, we may extend the definition of the conjugacy class of an element to the conjugacy class of a k-tuple, for a positive integer k. When k = 2, we are forming the conjugacy classes of ordered pairs, when k ... -
Entire Solutions to Dirichlet Type Problems
Sitar, Scott (University of Waterloo, 2007-08-02)In this thesis, we examined some Dirichlet type problems of the form: \begin{eqnarray*} \triangle u & = & 0\ {\rm in\ } \mathbb{R}^n \\ u & = & f\ {\rm on\ } \psi = 0, \end{eqnarray*} and we were particularly ...