2681 search results - page 46 / 537 » Problem F |
SODA
2010
ACM
15 years 8 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
CIAC
2006
Springer
15 years 3 months ago
2006
Springer
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )
SIAMCO
2002
14 years 11 months ago
2002
We consider the problem of minimizing autonomous, simple integrals like (P) min T 0 f x(t) , x (t) dt: x AC([0 , T]) with x(0) = x0 and x(T) = xT where f : R
MOR
2010
14 years 9 months ago
2010
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
AICCSA
2007
IEEE
15 years 5 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...