Sciweavers

1221 search results - page 89 / 245
» Balanced graph partitioning
Sort
View
P2P
2009
IEEE
231views Communications» more  P2P 2009»
14 years 3 months ago
Measuring the Cost of Online Load-Balancing in Distributed Range-Queriable Systems
Distributed systems such as Peer-to-Peer overlays have been shown to efficiently support the processing of range queries over large numbers of participating hosts. In such system...
Ioannis Konstantinou, Dimitrios Tsoumakos, Nectari...
ECRTS
2010
IEEE
13 years 10 months ago
Partitioning Parallel Applications on Multiprocessor Reservations
A full exploitation of the computational power available in a multi-core platform requires the software to be specified in terms of parallel execution flows. At the same time, mode...
Giorgio C. Buttazzo, Enrico Bini, Yifan Wu
CORR
2011
Springer
268views Education» more  CORR 2011»
13 years 15 days ago
Approximation Algorithms for Submodular Multiway Partition
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
Chandra Chekuri, Alina Ene
ENDM
2007
140views more  ENDM 2007»
13 years 9 months ago
Acyclic dominating partitions
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...
Louigi Addario-Berry, Ross J. Kang
GD
2007
Springer
14 years 3 months ago
Multi-circular Layout of Micro/Macro Graphs
We propose a layout algorithm for micro/macro graphs, i.e. relational structures with two levels of detail. While the micro-level graph is given, the macro-level graph is induced b...
Michael Baur, Ulrik Brandes