Parameterized algorithms and data reduction for the short secluded s‐t‐path problem Full article
| Journal |
Networks
ISSN: 0028-3045 , E-ISSN: 1097-0037 |
||||||
|---|---|---|---|---|---|---|---|
| Output data | Year: 2019, Volume: 75, Number: 1, Pages: 34-63 Pages count : 30 DOI: 10.1002/net.21904 | ||||||
| Tags | fixed-parameter tractability; kernelization lower bounds; NP-hard problem; problem kernelization; subexponential time; treewidth | ||||||
| Authors |
|
||||||
| Affiliations |
|
Cite:
Bevern R.
, Fluschnik T.
, Tsidulko O.Y.
Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
Networks. 2019. V.75. N1. P.34-63. DOI: 10.1002/net.21904 WOS Scopus OpenAlex
Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
Networks. 2019. V.75. N1. P.34-63. DOI: 10.1002/net.21904 WOS Scopus OpenAlex
Identifiers:
| Web of science: | WOS:000484011100001 |
| Scopus: | 2-s2.0-85071289401 |
| OpenAlex: | W3103988870 |