3958 search results - page 241 / 792 » Dynamic Graph Algorithms with Applications |
195
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
193
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
209
click to vote
PAAPP
2000
15 years 6 months ago
2000
Minimizing the amount of time and number of processors needed to perform an application reduces the application's fabrication cost and operation costs. A directed acyclic gra...
199
click to vote
JSS
2007
15 years 6 months ago
2007
In object oriented database management systems, clustering has proven to be one of the most effective performance enhancement techniques. Existing clustering algorithms are mainly...
168
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria