Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems

DOI10.1007/978-3-540-85097-7_5zbMath1168.68440MaRDI QIDQ5505642

Johannes Uhlmann, Nadja Betzler

Publication date: 27 January 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_5

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

91B12: Voting theory

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C20: Directed graphs (digraphs), tournaments