Sciweavers

Share
INFOCOM
2012
IEEE
6 years 10 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...
INFOCOM
2012
IEEE
6 years 10 months ago
On superposition of heterogeneous edge processes in dynamic random graphs
—This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive...
Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov
STACS
2012
Springer
7 years 3 months ago
Low Randomness Rumor Spreading via Hashing
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
George Giakkoupis, Thomas Sauerwald, He Sun, Phili...
CN
2010
121views more  CN 2010»
8 years 5 months ago
Probabilistic flooding for efficient information dissemination in random graph topologies
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis ...
RSA
2010
98views more  RSA 2010»
8 years 6 months ago
Merging percolation on Zd and classical random graphs: Phase transition
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...
Tatyana S. Turova, Thomas Vallier
JDWM
2010
180views more  JDWM 2010»
8 years 6 months ago
Investigating the Properties of a Social Bookmarking and Tagging Network
Social networks and collaborative tagging systems are rapidly gaining popularity as a primary means for storing and sharing data among friends, family, colleagues, or perfect stra...
Ralitsa Angelova, Marek Lipczak, Evangelos E. Mili...
CORR
2008
Springer
118views Education» more  CORR 2008»
8 years 7 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
TCAD
2002
145views more  TCAD 2002»
8 years 8 months ago
Automatic generation of synthetic sequential benchmark circuits
The design of programmable logic architectures and supporting computer-aided design tools fundamentally requires both a good understanding of the combinatorial nature of netlist gr...
Michael D. Hutton, Jonathan Rose, Derek G. Corneil
AML
1999
135views more  AML 1999»
8 years 8 months ago
Random graphs in the monadic theory of order
We continue the works of Gurevich-Shelah and Lifsches-Shelah by showing that it is consistent with ZFC that the first-order theory of random graphs is not interpretable in the mon...
Shmuel Lifsches, Saharon Shelah
COMBINATORICS
2000
89views more  COMBINATORICS 2000»
8 years 8 months ago
A Note on the Non-Colorability Threshold of a Random Graph
In this paper we consider the problem of establishing a value r0 such that almost all random graphs with n vertices and rn edges, r > r0, are asymptotically not 3-colorable. In...
Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C....
books