1221 search results - page 22 / 245 » Balanced graph partitioning |
WG
2009
Springer
14 years 3 months ago
2009
Springer
ICML
2004
IEEE
14 years 9 months ago
2004
IEEE
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniqu...
JGT
2006
13 years 8 months ago
2006
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
CASES
2001
ACM
14 years 13 days ago
2001
ACM
With the widening performance gap between processors and main memory, efficient memory accessing behavior is necessary for good program performance. Loop partition is an effective...
EJC
2007
13 years 8 months ago
2007
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...