260 search results - page 12 / 52 » Hardness of Parameterized Resolution |
153
Voted
ACID
2006
15 years 3 months ago
2006
The r-Regular Induced Subgraph problem asks, given a graph G and a nonnegative integer k, whether G contains an r-regular induced subgraph of size at least k, that is, an induced ...
115
click to vote
ISBI
2004
IEEE
16 years 2 months ago
2004
IEEE
We present a variational framework for determination of intra-voxel fiber orientations from High Angular Resolution Diffusion-Weighted (HARD) MRI under the assumption of biGaussia...
111
click to vote
IWPEC
2004
Springer
15 years 7 months ago
2004
Springer
In the precoloring extension problem (PrExt) a graph is given with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to...
127
click to vote
TAMC
2010
Springer
15 years 7 months ago
2010
Springer
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...