1206 search results - page 81 / 242 » Arc-Flags in Dynamic Graphs |
112
Voted
COMPLEX
2009
Springer
15 years 4 months ago
2009
Springer
Studies of the Internet have typically focused either on the routing system, i.e. the paths chosen to reach a given destination, or on the evolution of traffic on a physical link. ...
114
click to vote
DIALM
2005
ACM
15 years 2 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
102
click to vote
DIAGRAMS
2008
Springer
15 years 2 months ago
2008
Springer
Research on effective algorithms for efficient graph layout continues apace, and faster technology has led to increasing research on algorithms for the depiction of dynamic graphs ...
99
Voted
SDM
2007
SIAM
15 years 2 months ago
2007
SIAM
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
98
Voted
CORR
2010
Springer
15 years 25 days ago
2010
Springer
`Approximate message passing' algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive num...