Sciweavers

13214 search results - page 58 / 2643
» Pseudorandomness for network algorithms
Sort
View
CORR
2008
Springer
132views Education» more  CORR 2008»
15 years 6 months ago
Betweenness Centrality : Algorithms and Lower Bounds
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...
Shiva Kintali
MOBIHOC
2004
ACM
16 years 5 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
SWAT
2000
Springer
111views Algorithms» more  SWAT 2000»
15 years 9 months ago
Fibonacci Correction Networks
Grzegorz Stachowiak