The complexity of multicut and mixed multicut problems in (di)graphs (Q391767)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6244484
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of multicut and mixed multicut problems in (di)graphs |
scientific article; zbMATH DE number 6244484 |
Statements
The complexity of multicut and mixed multicut problems in (di)graphs (English)
0 references
13 January 2014
0 references
multicut
0 references
mixed graphs
0 references
mixed problem
0 references
dichotomy
0 references
NP-complete
0 references
feedback arc set
0 references
0.8112291097640991
0 references
0.8057007193565369
0 references
0.7904295325279236
0 references
0.784318208694458
0 references
