A tight algorithm for strongly connected Steiner subgraph on two terminals with demands (Q524378)
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 6710375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight algorithm for strongly connected Steiner subgraph on two terminals with demands |
scientific article; zbMATH DE number 6710375 |
Statements
A tight algorithm for strongly connected Steiner subgraph on two terminals with demands (English)
0 references
2 May 2017
0 references
FPT algorithms
0 references
directed graphs
0 references
strongly connected Steiner subgraph
0 references
exponential time hypothesis
0 references
0 references
0 references
0.996813416481018
0 references
0.8553983569145203
0 references
0.8474072813987732
0 references
0.7864810824394226
0 references
0.7333275079727173
0 references
