Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism (Q5363762): Difference between revisions
From MaRDI portal
Set profile property. |
Changed label, description and/or aliases in en, and other parts |
||
| label / en | label / en | ||
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism | |||
| Property / arXiv classification | |||
cs.DS | |||
| Property / arXiv classification: cs.DS / rank | |||
Normal rank | |||
| Property / arXiv classification | |||
math.CO | |||
| Property / arXiv classification: math.CO / rank | |||
Normal rank | |||
Revision as of 15:59, 19 April 2024
scientific article; zbMATH DE number 6784960
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism |
scientific article; zbMATH DE number 6784960 |
Statements
29 September 2017
0 references
parameterized complexity
0 references
fixed-parameter tractable algorithm
0 references
multiway cut
0 references
digraph homomorphism
0 references
cs.DS
0 references
math.CO
0 references
