Join Our Newsletter

CORR

2011

Springer

8 years 5 months ago
2011

Springer

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...

MST

2010

8 years 8 months ago
2010

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...

JACM

2010

8 years 8 months ago
2010

We present a linear expected time algorithm for ﬁnding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic f...

STOC

2000

ACM

9 years 2 months ago
2000

ACM

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 ...

SIGMETRICS

2003

ACM

9 years 3 months ago
2003

ACM

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...

STOC

2002

ACM

9 years 10 months ago
2002

ACM

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...