Random trees and random graphs
proceedings of the eighth international conference on Random structures and algorithms
Trawling the Web for emerging cyber-communities
WWW '99 Proceedings of the eighth international conference on World Wide Web
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Extracting Large-Scale Knowledge Bases from the Web
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Studying Recommendation Algorithms by Graph Analysis
Journal of Intelligent Information Systems
Buckets Strike Back: Improved Parallel Shortest Paths
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Random evolution in massive graphs
Handbook of massive data sets
The web structure of e-government - developing a methodology for quantitative evaluation
Proceedings of the 15th international conference on World Wide Web
Theoretical Computer Science - Complex networks
Relevance of massively distributed explorations of the internet topology: qualitative results
Computer Networks: The International Journal of Computer and Telecommunications Networking
Describing and simulating internet routes
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy efficient randomised communication in unknown AdHoc networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Energy efficient randomised communication in unknown AdHoc networks
Theoretical Computer Science
A fast algorithm to calculate powers of a Boolean matrix for diameter computation of random graphs
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Bipartite graphs as models of complex networks
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
WAC'05 Proceedings of the Second international IFIP conference on Autonomic Communication
Hi-index | 0.00 |
Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by so-called the “power law”. Here we determine the diameter of random power law graphs up to a constant factor for almost all ranges of parameters. These results show a strong evidence that the diameters of most massive graphs are about logarithm of their sizes up to a constant factor.