An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (Q477657): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2014.09.027 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2014.09.027 / rank | |||
Normal rank | |||
Latest revision as of 18:41, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes |
scientific article |
Statements
An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (English)
0 references
9 December 2014
0 references
directed Steiner tree
0 references
parameterized complexity
0 references
dynamic programming
0 references
algorithms
0 references
combinatorial problems
0 references
0 references
