Sciweavers

89 search results - page 2 / 18
» How Crucial is Small World Connectivity for Dynamics
Sort
View
CSC
2009
13 years 6 months ago
Fast Monte Carlo Algorithms on Re-Wired Small-World Spin Models
Small-world networks have become an important model for understanding many complex phenomena in science and in sociological contexts. One tool for exploring the critical and phase...
Kenneth A. Hawick
IWQOS
2004
Springer
13 years 10 months ago
Small world overlay P2P networks
In this paper, we consider how to “construct” and “maintain” an overlay structured P2P network based on the “smallworld paradigm”. Two main attractive properties of a ...
Ken Y. K. Hui, John C. S. Lui, David K. Y. Yau
COMPGEOM
2007
ACM
13 years 9 months ago
Embedding 3-polytopes on a small grid
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
Ares Ribó Mor, Günter Rote, Andr&eacut...
DCG
2011
13 years 12 days ago
Small Grid Embeddings of 3-Polytopes
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...
Ares Ribó Mor, Günter Rote, Andr&eacut...
IPPS
2010
IEEE
13 years 3 months ago
A scalable algorithm for maintaining perpetual system connectivity in dynamic distributed systems
We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and pr...
Tarun Bansal, Neeraj Mittal