1221 search results - page 33 / 245 » Balanced graph partitioning |
DM
2008
13 years 9 months ago
2008
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique...
SIAMDM
2010
13 years 3 months ago
2010
Abstract. The conjecture of Bollob
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
We propose a load balancing heuristic for parallel adaptive finite element method (FEM) simulations. In contrast to most existing approaches, the heuristic focuses on good partit...
ICDT
2009
ACM
14 years 9 months ago
2009
ACM
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
ICPP
2009
IEEE
14 years 3 months ago
2009
IEEE
—Recent advances in DNA sequencing techniques have led to an unprecedented accumulation and availability of molecular sequence data that needs to be analyzed. This data explosion...