Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q2849356)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parameterized Complexity of Directed Steiner Tree on Sparse Graphs |
scientific article; zbMATH DE number 6208884
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized Complexity of Directed Steiner Tree on Sparse Graphs |
scientific article; zbMATH DE number 6208884 |
Statements
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (English)
0 references
17 September 2013
0 references
0.99999994
0 references
0.91525906
0 references
0.9132017
0 references
0.9132017
0 references
0.9043744
0 references
0.9043744
0 references
0.9034005
0 references
