New XP algorithm for Short Secluded Path parameterized by cliquewidth, FPT algorithms by neighborhood diversity and twin cover, and a polynomial-time algorithm for Shortest Secluded Path on unweighted graphs.
An optimal XP algorithm for hamiltonian cycle on graphs of bounded clique-width.Algorithmica, 82(6):1654–1674
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
On the Complexity of Secluded Path Problems
New XP algorithm for Short Secluded Path parameterized by cliquewidth, FPT algorithms by neighborhood diversity and twin cover, and a polynomial-time algorithm for Shortest Secluded Path on unweighted graphs.