No. Title Author Year
1 Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs Eden, Talya et al. 2022
2 Embeddings and Labeling Schemes for A* Eden, Talya et al. 2022
3 Sampling Multiple Edges Efficiently Eden, Talya et al. 2021
4 Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time Biswas, Amartya Shankha et al. 2021
5 Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles Eden, Talya et al. 2019
6 The Arboricity Captures the Complexity of Sampling Edges Eden, Talya et al. 2019
7 Lower Bounds for Approximating Graph Parameters via Communication Complexity Eden, Talya et al. 2018
8 On Sampling Edges Almost Uniformly Eden, Talya et al. 2018
9 Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection Eden, Talya et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 9

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI