Sciweavers

296 search results - page 4 / 60
» Bipartite Graphs as Models of Complex Networks
Sort
View
SDM
2004
SIAM
229views Data Mining» more  SDM 2004»
13 years 10 months ago
R-MAT: A Recursive Model for Graph Mining
How does a `normal' computer (or social) network look like? How can we spot `abnormal' sub-networks in the Internet, or web graph? The answer to such questions is vital ...
Deepayan Chakrabarti, Yiping Zhan, Christos Falout...
IS
2008
13 years 8 months ago
Clustering spatial networks for aggregate query processing: A hypergraph approach
In spatial networks, clustering adjacent data to disk pages is highly likely to reduce the number of disk page accesses made by the aggregate network operations during query proce...
Engin Demir, Cevdet Aykanat, Berkant Barla Cambazo...
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
14 years 8 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
DM
2011
264views Education» more  DM 2011»
13 years 3 months ago
Connectivity threshold and recovery time in rank-based models for complex networks
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
Pawel Pralat
ISAAC
2005
Springer
153views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Network Game with Attacker and Protector Entities
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...