Sciweavers

867 search results - page 109 / 174
» Network Robustness and Graph Topology
Sort
View
ICDCS
2005
IEEE
14 years 1 months ago
FraNtiC: A Fractal Geometric Framework for Mesh-Based Wireless Access Networks
The design of the access networks of next generation broadband wireless systems requires special attention in the light of changing network characteristics. In this paper, we pres...
Samik Ghosh, Kalyan Basu, Sajal K. Das
ICDE
2008
IEEE
122views Database» more  ICDE 2008»
14 years 9 months ago
On Signatures for Communication Graphs
Abstract-- Communications between individuals can be represented by (weighted, multi-) graphs. Many applications operate on communication graphs associated with telephone calls, em...
Graham Cormode, Flip Korn, S. Muthukrishnan, Yihua...
ICDM
2010
IEEE
105views Data Mining» more  ICDM 2010»
13 years 5 months ago
On the Vulnerability of Large Graphs
Given a large graph, like a computer network, which k nodes should we immunize (or monitor, or remove), to make it as robust as possible against a computer virus attack? We need (...
Hanghang Tong, B. Aditya Prakash, Charalampos E. T...
BIBE
2006
IEEE
160views Bioinformatics» more  BIBE 2006»
14 years 1 months ago
Methods for Random Modularization of Biological Networks
— Biological networks are formalized summaries of our knowledge about interactions among biological system components, like genes, proteins, or metabolites. From their global top...
Zachary M. Saul, Vladimir Filkov
SDM
2008
SIAM
164views Data Mining» more  SDM 2008»
13 years 9 months ago
Randomizing Social Networks: a Spectrum Preserving Approach
Understanding the general properties of real social networks has gained much attention due to the proliferation of networked data. The nodes in the network are the individuals and...
Xiaowei Ying, Xintao Wu