FPT Inapproximability of Directed Cut and Connectivity Problems (Q5875540): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
FPT Inapproximability of Directed Cut and Connectivity Problems | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2997610302 / rank | |||
Normal rank | |||
| Property / title | |||
FPT Inapproximability of Directed Cut and Connectivity Problems (English) | |||
| Property / title: FPT Inapproximability of Directed Cut and Connectivity Problems (English) / rank | |||
Normal rank | |||
Latest revision as of 10:25, 30 July 2024
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
