Sciweavers

598 search results - page 9 / 120
» A random graph model for massive graphs
Sort
View
CAAN
2007
Springer
14 years 5 months ago
Vertex Pursuit Games in Stochastic Network Models
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
Anthony Bonato, Pawel Pralat, Changping Wang
IPPS
2007
IEEE
14 years 5 months ago
Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
Joseph R. Crobak, Jonathan W. Berry, Kamesh Maddur...
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
14 years 4 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
INFOCOM
2012
IEEE
12 years 1 months ago
Impact of power-law topology on IP-level routing dynamics: Simulation results
—This paper focuses on the Internet IP-level routing topology and proposes relevant explanations to its apparent dynamics. We first represent this topology as a power-law random...
Amelie Medem Kuatse, Clémence Magnien, Fabi...
RSA
2011
124views more  RSA 2011»
13 years 5 months ago
Sparse random graphs with clustering
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
Béla Bollobás, Svante Janson, Oliver...