543 search results - page 15 / 109 » A Multiagent Algorithm for Graph Partitioning |
105
click to vote
MASCOTS
2003
15 years 1 months ago
2003
Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the n...
99
Voted
DCC
2008
IEEE
16 years 2 days ago
2008
IEEE
We introduce an EDIF netlist graph algorithm which is lossy with respect to the original byte stream but lossless in terms of the circuit information it contains based on a graph ...
103
click to vote
CVPR
2005
IEEE
16 years 2 months ago
2005
IEEE
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...
120
click to vote
PADS
2004
ACM
15 years 5 months ago
2004
ACM
We investigated the benefit of exploiting the symmetries of graphs for partitioning. We represent the model to be simulated by a weighted graph. Graph symmetries are studied in th...
96
Voted
COMBINATORICA
2007
15 years 2 days ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...