Parameterized algorithms and data reduction for the short secluded s-t-path problem › Research Explorer

Novosibirsk State University's Research Portal

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

Research output: Contribution to journal › Article › peer-review

DOI

https://doi.org/10.1002/net.21904
Final published version

Original language	English
Pages (from-to)	34-63
Number of pages	30
Journal	Networks
Volume	75
Issue number	1
DOIs	https://doi.org/10.1002/net.21904
Publication status	Published - Jan 2020

OECD FOS+WOS

Research areas

fixed-parameter tractability, kernelization lower bounds, NP-hard problem, problem kernelization, subexponential time, treewidth, EULERIAN EXTENSION, APPROXIMATION, COMPLEXITY

ID: 21344933