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 this page instead for the normal view: A tight algorithm for strongly connected Steiner subgraph on two terminals with demands |
scientific article; zbMATH DE number 6710375
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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 references
