Approximating average parameters of graphs
From MaRDI portal
Publication:3514701
DOI10.1002/rsa.20203zbMath1155.05057MaRDI QIDQ3514701
Publication date: 21 July 2008
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2006/553/
Wiener index; randomized approximation algorithms; sublinear-time algorithms; distance queries; average distance in a graph; everage degree of a graph; standard neighbor queries
05C80: Random graphs (graph-theoretic aspects)
05C12: Distance in graphs
05C85: Graph algorithms (graph-theoretic aspects)
05C07: Vertex degrees
Related Items
Cites Work