Sciweavers

8 search results - page 1 / 2
» iwpec 2010
Sort
View
IWPEC
2010
Springer
13 years 8 months ago
On the Grundy Number of a Graph
The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm ...
Frédéric Havet, Leonardo Sampaio
IWPEC
2010
Springer
13 years 8 months ago
Multivariate Complexity Analysis of Swap Bribery
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
Britta Dorn, Ildikó Schlotter
IWPEC
2010
Springer
13 years 8 months ago
Partial Kernelization for Rank Aggregation: Theory and Experiments
RANK AGGREGATION is important in many areas ranging from web search over databases to bioinformatics. The underlying decision problem KEMENY SCORE is NP-complete even in case of fo...
Nadja Betzler, Robert Bredereck, Rolf Niedermeier