Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:27, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized algorithms for min-max multiway cut and list digraph homomorphism |
scientific article |
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
