Sciweavers

INFOCOM
2012
IEEE
12 years 2 months ago
Multiple random walks to uncover short paths in power law networks
—Developing simple distributed algorithms to allow nodes to perform topology discovery and message routing using incomplete topological information is a problem of great interest...
Bruno F. Ribeiro, Prithwish Basu, Don Towsley
ASUNAM
2011
IEEE
13 years 13 days ago
DisNet: A Framework for Distributed Graph Computation
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
Ryan Lichtenwalter, Nitesh V. Chawla
SCIENTOMETRICS
2010
158views more  SCIENTOMETRICS 2010»
13 years 10 months ago
Rete-netzwerk-red: analyzing and visualizing scholarly networks using the Network Workbench Tool
The enormous increase in digital scholarly data and computing power combined with recent advances in text mining, linguistics, network science, and scientometrics make it possible...
Katy Börner, Weixia Huang, Micah Linnemeier, ...