Sciweavers

292 search results - page 25 / 59
» Scaling properties of the Internet graph
Sort
View
CPHYSICS
2011
271views Education» more  CPHYSICS 2011»
12 years 11 months ago
A dedicated algorithm for calculating ground states for the triangular random bond Ising model
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
O. Melchert, A. K. Hartmann
CCR
2002
130views more  CCR 2002»
13 years 7 months ago
Network topologies, power laws, and hierarchy
It has long been thought that the Internet, and its constituent networks, are hierarchical in nature. Consequently, the network topology generators most widely used by the Interne...
Hongsuda Tangmunarunkit, Ramesh Govindan, Sugih Ja...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 8 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
WISE
2000
Springer
13 years 12 months ago
Visualization of Web-based Workspace Structures
Web-based collaboration is becoming increasingly common. Often such collaboration exhibits emergent characteristics, for which systems based on a notion of workspaces provide suit...
Robert P. Biuk-Aghai
IJMMS
2007
166views more  IJMMS 2007»
13 years 7 months ago
Visualization of large networks with min-cut plots, A-plots and R-MAT
What 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 f...
Deepayan Chakrabarti, Christos Faloutsos, Yiping Z...