Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions) (Q5221061)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7183692
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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.982536256313324
0 references
0.8596824407577515
0 references
0.8553983569145203
0 references
0.8146820664405823
0 references
0.8053946495056152
0 references
