Sciweavers

Share
CORR
2011
Springer
152views Education» more  CORR 2011»
8 years 5 months ago
Topology Discovery of Sparse Random Graphs With Few Participants
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
Animashree Anandkumar, Avinatan Hassidim, Jonathan...
MST
2010
98views more  MST 2010»
8 years 8 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
JACM
2010
111views more  JACM 2010»
8 years 8 months ago
Finding a maximum matching in a sparse random graph in O(n) expected time
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic f...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
STOC
2000
ACM
112views Algorithms» more  STOC 2000»
9 years 2 months ago
A random graph model for massive graphs
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
William Aiello, Fan R. K. Chung, Linyuan Lu
SIGMETRICS
2003
ACM
150views Hardware» more  SIGMETRICS 2003»
9 years 3 months ago
Conductance and congestion in power law graphs
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
Christos Gkantsidis, Milena Mihail, Amin Saberi
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
9 years 10 months ago
Almost all graphs with average degree 4 are 3-colorable
We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., G?n; p ? d=n?; are 3-colorable a...
Dimitris Achlioptas, Cristopher Moore
books