194 search results - page 4 / 39 » The Parameterized Complexity of Some Minimum Label Problems |
146
click to vote
IJAC
2007
15 years 5 months ago
2007
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
147
click to vote
TAMC
2009
Springer
16 years 7 days ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
128
click to vote
IANDC
2010
15 years 4 months ago
2010
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
DAGM
2003
Springer
15 years 11 months ago
2003
Springer
Optimal labeling problems are NP-hard in many practically important cases. Sufficient conditions for optimal label detection in every pixel are formulated. Knowing the values of th...
187
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...