Sciweavers

102 search results - page 19 / 21
» Spanning trees with minimum weighted degrees
Sort
View
RSA
2010
108views more  RSA 2010»
13 years 4 months ago
Resolvent of large random graphs
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...
Charles Bordenave, Marc Lelarge
JDA
2007
97views more  JDA 2007»
13 years 5 months ago
Local solutions for global problems in wireless networks
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
Jorge Urrutia
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
13 years 11 months ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
ICDM
2010
IEEE
232views Data Mining» more  ICDM 2010»
13 years 3 months ago
gSkeletonClu: Density-Based Network Clustering via Structure-Connected Tree Division or Agglomeration
Community detection is an important task for mining the structure and function of complex networks. Many pervious approaches are difficult to detect communities with arbitrary size...
Heli Sun, Jianbin Huang, Jiawei Han, Hongbo Deng, ...
GLOBECOM
2009
IEEE
13 years 9 months ago
R-Code: Network Coding Based Reliable Broadcast in Wireless Mesh Networks with Unreliable Links
Broadcast is an important primitive in wireless mesh networks (WMNs). Applications like network-wide software update require reliable reception of the content with low-latency and ...
Zhenyu Yang, Ming Li, Wenjing Lou