1930 search results - page 5 / 386 » A Dynamic Graph Algorithm for the Highly Dynamic Network Pro... |
117
click to vote
ATMOS
2010
15 years 1 months ago
2010
The aim of the train timetabling problem is to find a conflict free timetable for a set of passenger and freight trains along their routes in an infrastructure network. Several ...
132
click to vote
ICDCS
2005
IEEE
15 years 7 months ago
2005
IEEE
We consider distributed applications that continuously stream data across the network, where data needs to be aggregated and processed to produce a 'useful' stream of up...
125
click to vote
JDA
2006
15 years 2 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
112
click to vote
ESA
2004
Springer
15 years 7 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
130
click to vote
ICC
2009
IEEE
15 years 9 months ago
2009
IEEE
A graph-based framework for dynamic fractional frequency reuse (FFR) in multi-cell OFDMA networks is proposed in this work. FFR is a promising resource allocation technique that c...