# Parameterized algorithms and data reduction for the short secluded s-t-path problem

arXiv: https://arxiv.org/abs/1806.09540 · HTML: https://mlsanity.com/paper/1806.09540/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 25 Jun 2018.

## Built on by (most cited first, 1 of 1)

- [The Complexity of Bayesian Network Learning: Revisiting the Superstructure](https://mlsanity.com/paper/2602.10253/) (2026)

## Abstract (arXiv)

Given a graph G=(V,E), two vertices s,t∈ V, and two integers k,ℓ, the Short Secluded Path problem is to find a simple s-t-path with at most k vertices and ℓ neighbors. We study the parameterized complexity of the problem with respect to four structural graph parameters: the vertex cover number, treewidth, feedback vertex number, and feedback edge number. In particular, we completely settle the question of the existence of problem kernels with size polynomial in these parameters and their combinations with k and ℓ. We also obtain a 2O(w)· ℓ2· n-time algorithm for graphs of treewidth w, which yields subexponential-time algorithms in several graph classes.