Brief announcement: How large is your graph?

DOI10.1145/3087801.3087855MaRDI QIDQ5368962zbMATH OpenOpenAlexFDO

Authors Varun Kanade, Frederik Mallmann-Trenn, Víctor Verdugo

Publication date 11 October 2017

Published in Proceedings of the ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3087801.3087855

zbMATH Keywords

estimationrandom walkssocial networks

Mathematics Subject Classification ID

Random walks on graphs (05C81) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• How large is your graph?
• On the Complexity of Sampling Vertices Uniformly from a Graph
• Sublinear Algorithms for Local Graph-Centrality Estimation
• Counting stars and other small subgraphs in sublinear-time
• On sampling edges almost uniformly

Cited in

(4)

• How unproportional must a graph be?
• Estimating graph parameters with random walks
• On the estimate of the size of a directed graph
• How large is your graph?

This page was built for publication: Brief announcement: How large is your graph?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5368962)