61 search results - page 12 / 13 » The diameter of random massive graphs |
TAMC
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
VIS
2005
IEEE
14 years 7 months ago
2005
IEEE
We study the problem of visualizing large networks and develop es for effectively abstracting a network and reducing the size to a level that can be clearly viewed. Our size reduc...
WAW
2007
Springer
14 years 4 days ago
2007
Springer
Popular reputation systems for linked networks can be manipulated by spammers who strategically place links. The reputation of node v is interpreted as the world’s opinion of vâ...
BMCBI
2007
13 years 6 months ago
2007
Background: Protein interactions support cell organization and mediate its response to any specific stimulus. Recent technological advances have produced large data-sets that aim ...
TPDS
2010
13 years 4 months ago
2010
—In an n-way broadcast application, each one of n overlay nodes wants to push its own distinct large data file to all other n À 1 destinations as well as download their respecti...