FPT Inapproximability of Directed Cut and Connectivity Problems (Q5875540)
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: FPT Inapproximability of Directed Cut and Connectivity Problems |
scientific article; zbMATH DE number 7650216
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | FPT Inapproximability of Directed Cut and Connectivity Problems |
scientific article; zbMATH DE number 7650216 |
Statements
3 February 2023
0 references
directed graphs
0 references
cuts
0 references
connectivity
0 references
Steiner problems
0 references
FPT inapproximability
0 references
FPT Inapproximability of Directed Cut and Connectivity Problems (English)
0 references
