Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPIcs.STACS.2019.25 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPICS.STACS.2019.25 / rank | |||
Normal rank | |||
Latest revision as of 15:53, 30 December 2024
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
