2137 search results - page 35 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
ICCV
1999
IEEE
14 years 10 months ago
1999
IEEE
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
CATS
2008
13 years 10 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
ISCA
2002
IEEE
13 years 8 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
WAOA
2010
Springer
13 years 6 months ago
2010
Springer
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
WG
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...