Approximating average parameters of graphs

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

Full description

Saved in:

Bibliographic Details
Published in:	Random structures & algorithms Vol. 32; no. 4; pp. 473 - 493
Main Authors:	Goldreich, Oded, Ron, Dana
Format:	Journal Article
Language:	English
Published:	Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.07.2008
Subjects:	randomized approximation algorithms sublinear-time algorithms Wiener index
ISSN:	1042-9832, 1098-2418
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!