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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative 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.