Hardness of cut problems in directed graphs (Q2931415)
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: Hardness of cut problems in directed graphs |
scientific article; zbMATH DE number 6373925
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness of cut problems in directed graphs |
scientific article; zbMATH DE number 6373925 |
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
0.9174296855926514
0 references
0.858298122882843
0 references
0.8403007388114929
0 references
0.8401216268539429
0 references
0.8385656476020813
0 references
