1951 search results - page 78 / 391 » An algorithm for improving graph partitions |
135
click to vote
VLDB
1991
ACM
15 years 7 months ago
1991
ACM
Shared nothing multiprocessor archit.ecture is known t.obe more scalable to support very large databases. Compared to other join strategies, a hash-ba9ed join algorithm is particu...
145
Voted
CSE
2009
IEEE
15 years 1 months ago
2009
IEEE
Edges in social network graphs can model sensitive relationships. In this paper, we consider the problem of edges anonymity in graphs. We propose a probabilistic notion of edge ano...
118
click to vote
ICCAD
1997
IEEE
15 years 8 months ago
1997
IEEE
Logic replication, the duplication of logic in order to limit communication between partitions, is an effective part of a complete partitioning solution. In this paper we seek a b...
142
click to vote
SIAMCOMP
2010
14 years 11 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
116
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...