Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830)
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: Parameterized algorithms for min-max multiway cut and list digraph homomorphism |
scientific article; zbMATH DE number 6723278
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized algorithms for min-max multiway cut and list digraph homomorphism |
scientific article; zbMATH DE number 6723278 |
Statements
Parameterized algorithms for min-max multiway cut and list digraph homomorphism (English)
0 references
26 May 2017
0 references
parameterized complexity
0 references
fixed-parameter tractable algorithm
0 references
multiway cut
0 references
digraph homomorphism
0 references
0 references
0 references
0.9885016083717346
0 references
0.7749634385108948
0 references
0.7687862515449524
0 references
0.748002290725708
0 references
0.7435449361801147
0 references
