1930 search results - page 7 / 386 » A Dynamic Graph Algorithm for the Highly Dynamic Network Pro... |
ESA
1997
Springer
13 years 11 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
COMGEO
1999
ACM
13 years 7 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
PODC
2011
ACM
12 years 10 months ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
HIS
2008
13 years 8 months ago
2008
In this paper, we present an algorithm based on the GRASP metaheuristic for solving a dynamic assignment problem in a P2P network designed for sending real-time video over the Int...
WEBI
2007
Springer
14 years 1 months ago
2007
Springer
Detecting densely connected subgroups in graphs such as communities in social networks is of interest in many research fields. Several methods have been developed to find commun...