Efficient and near-optimal algorithms for sampling connected subgraphs

DOI10.1145/3406325.3451042OpenAlexW3166803466MaRDI QIDQ6065238

Marco Bressan

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

random walkssublinear algorithmssubgraph sampling

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs

This page was built for publication: Efficient and near-optimal algorithms for sampling connected subgraphs