IWPEC
2010
Springer
13 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 ...
IWPEC
2010
Springer
13 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...
IWPEC
2010
Springer
13 years 10 months ago
2010
Springer
IWPEC
2010
Springer
13 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...
IWPEC
2010
Springer
13 years 10 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
IWPEC
2010
Springer
13 years 10 months ago
2010
Springer
IWPEC
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on parts of the solution. The technique turne...