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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2014.09.027 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2005716729 / rank | |||
Normal rank | |||
Revision as of 21:56, 19 March 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
