On the computational complexity of length- and neighborhood-constrained path problems (Q2294439)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of length- and neighborhood-constrained path problems |
scientific article |
Statements
On the computational complexity of length- and neighborhood-constrained path problems (English)
0 references
11 February 2020
0 references
computational complexity
0 references
fixed-parameter tractability
0 references
problem kernelization
0 references
secludedness
0 references
0 references
