8 search results - page 1 / 2 » iwpec 2010 |
IWPEC
2010
Springer
14 years 10 months ago
2010
Springer
IWPEC
2010
Springer
14 years 10 months ago
2010
Springer
129
click to vote
IWPEC
2010
Springer
14 years 10 months ago
2010
Springer
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 ...
140
click to vote
IWPEC
2010
Springer
14 years 10 months ago
2010
Springer
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...
126
click to vote
IWPEC
2010
Springer
14 years 10 months ago
2010
Springer
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...