Hardness of cut problems in directed graphs (Q2931415)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness of cut problems in directed graphs |
scientific article |
Statements
Hardness of cut problems in directed graphs (English)
0 references
25 November 2014
0 references
directed multicut
0 references
hardness of approximation
0 references
sparsest cut
0 references
