Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs

Marco Bressan 0002. Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs. ACM Transactions on Algorithms, 19(3), July 2023. [doi]

Abstract

Abstract is missing.