Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061)
From MaRDI portal
scientific article; zbMATH DE number 7183692
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) |
scientific article; zbMATH DE number 7183692 |
Statements
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (English)
0 references
27 March 2020
0 references
strongly connected Steiner subgraph
0 references
FPT algorithms
0 references
directed Steiner network
0 references
exponential time hypothesis
0 references
planar graphs
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
