796 search results - page 110 / 160 » The Anonymous Subgraph Problem |
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
101
click to vote
ESA
2006
Springer
15 years 3 months ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
118
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
100
click to vote
GD
2008
Springer
15 years 29 days ago
2008
Springer
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
108
click to vote
SIAMIS
2010
14 years 6 months ago
2010
Abstract. We propose an algorithmic framework for computing global solutions of variational models with convex regularity terms that permit quite arbitrary data terms. While the mi...