Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473)
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: Complexity of the Steiner Network Problem with Respect to the Number of Terminals |
scientific article; zbMATH DE number 7559134
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of the Steiner Network Problem with Respect to the Number of Terminals |
scientific article; zbMATH DE number 7559134 |
Statements
18 July 2022
0 references
directed Steiner network
0 references
planar graphs
0 references
parameterized algorithms
0 references
bounded genus
0 references
exponential time hypothesis
0 references
0 references
0 references
Complexity of the Steiner Network Problem with Respect to the Number of Terminals (English)
0 references
