Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| label / en | label / en | ||
Complexity of the Steiner Network Problem with Respect to the Number of Terminals | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPIcs.STACS.2019.25 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963676274 / rank | |||
Normal rank | |||
| Property / title | |||
Complexity of the Steiner Network Problem with Respect to the Number of Terminals (English) | |||
| Property / title: Complexity of the Steiner Network Problem with Respect to the Number of Terminals (English) / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPICS.STACS.2019.25 / rank | |||
Normal rank | |||
Latest revision as of 16: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
