License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-5531
URL: http://drops.dagstuhl.de/opus/volltexte/2006/553/
Go to the corresponding Portal


Goldreich, Oded ; Ron, Dana

Approximating Average Parameters of Graphs

pdf-format:
Document 1.pdf (248 KB)


Abstract

Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average degree of a graph and the average distance between pairs of vertices in a graph. Since our focus is on sublinear algorithms, these algorithms access the input graph via queries to an adequate oracle. We consider two types of queries. The first type is standard neighborhood queries (i.e., what is the i'th neighbor of vertex v?), whereas the second type are queries regarding the quantities that we need to find the average of (i.e., what is the degree of vertex v? and what is the distance between u and v, respectively). Loosely speaking, our results indicate a difference between the two problems: For approximating the average degree, the standard neighbor queries suffice and in fact are preferable to degree queries. In contrast, for approximating average distances, the standard neighbor queries are of little help whereas distance queries are crucial.

BibTeX - Entry

@InProceedings{goldreich_et_al:DSP:2006:553,
  author =	{Oded Goldreich and Dana Ron},
  title =	{Approximating Average Parameters of Graphs},
  booktitle =	{Sublinear Algorithms},
  year =	{2006},
  editor =	{Artur Czumaj and S. Muthu Muthukrishnan and Ronitt Rubinfeld and Christian Sohler},
  number =	{05291},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2006/553},
  annote =	{Keywords: Graph parameters, degree, distance}
}

Keywords: Graph parameters, degree, distance
Seminar: 05291 - Sublinear Algorithms
Issue Date: 2006
Date of publication: 28.08.2006


DROPS-Home | Fulltext Search | Imprint Published by LZI