2314 search results - page 3 / 463 » Minimal Partitions of a Graph |
PARA
2004
Springer
14 years 21 days ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
EVOW
2006
Springer
13 years 11 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
SPAA
2004
ACM
14 years 23 days ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
ICPADS
1998
IEEE
13 years 11 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
A novel multiregion graph cut image partitioning method combined with kernel mapping is presented. A kernel function transforms implicitly the image data into data of a higher dim...