Edge sampling and graph parameter estimation via vertex neighborhood accesses-Reference-Cited by-同舟云学术

Edge sampling and graph parameter estimation via vertex neighborhood accesses

Published:2022-06-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Tětek Jakub¹,Thorup Mikkel¹

Affiliation:

1. University of Copenhagen, Denmark

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3519935.3520059

Reference26 articles.

1. An adaptation of a root finding method to searching ordered disk files

2. Sepehr Assadi . 2020. CS 514: Advanced Algorithms II-Sublinear Algorithms 1 Sublinear Time Algorithms for Graphs . Rutgers University . https://www.cs.rutgers.edu/~sa1497/courses/cs514-s20/lec3.pdf Sepehr Assadi. 2020. CS 514: Advanced Algorithms II-Sublinear Algorithms 1 Sublinear Time Algorithms for Graphs. Rutgers University. https://www.cs.rutgers.edu/~sa1497/courses/cs514-s20/lec3.pdf

3. Omri Ben-Eliezer Talya Eden Joel Oren and Dimitris Fotakis. 2021. Sampling Multiple Nodes in Large Networks: Beyond Random Walks. arxiv:2110.13324. Omri Ben-Eliezer Talya Eden Joel Oren and Dimitris Fotakis. 2021. Sampling Multiple Nodes in Large Networks: Beyond Random Walks. arxiv:2110.13324.

4. How to Count Triangles, without Seeing the Whole Graph

5. On Sampling Nodes in a Network

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generic network sparsification via degree- and subgraph-based edge sampling;Information Sciences;2024-09

2. Better Sum Estimation via Weighted Sampling;ACM Transactions on Algorithms;2024-06-21

3. An adaptive graph sampling framework for graph analytics;Social Network Analysis and Mining;2023-12-06

4. DeMEtRIS: Counting (near)-Cliques by Crawling;Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining;2023-02-27