Sciweavers

598 search results - page 50 / 120
» A random graph model for massive graphs
Sort
View
INFOCOM
2009
IEEE
16 years 9 days ago
Lightweight Coloring and Desynchronization for Networks
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
Arik Motskin, Tim Roughgarden, Primoz Skraba, Leon...
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 5 months ago
Directed animals in the gas
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
Yvan Le Borgne, Jean-François Marckert
STTT
2008
86views more  STTT 2008»
15 years 5 months ago
Properties of state spaces and their applications
Explicit model checking algorithms explore the full state space of a system. State spaces are usually treated as directed graphs without any specific features. We gather a large co...
Radek Pelánek
WAW
2007
Springer
157views Algorithms» more  WAW 2007»
15 years 11 months ago
Stochastic Kronecker Graphs
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This...
Mohammad Mahdian, Ying Xu 0002
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 4 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...