Parameterized complexity of candidate control in elections and related digraph problems (Q1040585)
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 complexity of candidate control in elections and related digraph problems |
scientific article; zbMATH DE number 5638320
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity of candidate control in elections and related digraph problems |
scientific article; zbMATH DE number 5638320 |
Statements
Parameterized complexity of candidate control in elections and related digraph problems (English)
0 references
25 November 2009
0 references
computational social choice
0 references
digraph modification problems
0 references
\(W\)[1]-/\(W\)[2]-hardness
0 references
NP-hardness
0 references
Copeland\(^\alpha \) voting
0 references
plurality voting
0 references
0 references
