2314 search results - page 78 / 463 » Minimal Partitions of a Graph |
160
Voted
KDD
2012
ACM
13 years 6 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
103
Voted
DM
2008
15 years 3 months ago
2008
Let G be a minimally k-connected graph with n nodes and m edges. Mader proved that if n 3k - 2 then m k(n - k), and for n 3k - 1 an equality is possible if, and only if, G is t...
127
Voted
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
We propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local optimization heuristic whic...
131
Voted
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
Adopting multiple processing units to enhance the computing capability or reduce the power consumption has been widely accepted for designing modern computing systems. Such confi...
171
Voted
ANTSW
2004
Springer
15 years 7 months ago
2004
Springer
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...