scientific article; zbMATH DE number 1792101

zbMath1024.68073MaRDI QIDQ4552043

Linyuan Lu, William Aiello, Fan R. K. Chung

Publication date: 11 November 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Call graphsscale-free power law graphsWWW graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Scalable percolation search on complex networks, A preferential attachment model with random initial degrees, Social network influence and market instability, Preferential deletion in dynamic models of web-like networks, Distances in random graphs with finite variance degrees, Complex networks: structure and dynamics, Distance in random graphs with infinite mean degrees, A generalization of the Buckley-Osthus model for web graphs, A random graph model for clustering graphs, Techniques for analyzing dynamic random graph models of web-like networks: An overview, A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks, Synchronization in random networks with given expected degree sequences, On positive-influence target-domination, Diameters in preferential attachment models, On certain connectivity properties of the internet topology, The diameter of sparse random graphs, Network structure andn-dependence in agent-based herding models, A web model with power law exponents less than 2, A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs, On the Degree Sequence of an Evolving Random Graph Process and Its Critical Phenomenon, Popularity based random graph models leading to a scale-free degree sequence, On the mean distance in scale free graphs