Go to the corresponding LIPIcs Volume Portal 
Biswas, Amartya Shankha ; Eden, Talya ; Rubinfeld, Ronitt
pdfformat: 

@InProceedings{biswas_et_al:LIPIcs.APPROX/RANDOM.2021.55, author = {Biswas, Amartya Shankha and Eden, Talya and Rubinfeld, Ronitt}, title = {{Towards a DecompositionOptimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)}, pages = {55:155:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772075}, ISSN = {18688969}, year = {2021}, volume = {207}, editor = {Wootters, Mary and Sanit\`{a}, Laura}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14748}, URN = {urn:nbn:de:0030drops147480}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.55}, annote = {Keywords: Sublinear time algorithms, Graph algorithms, Sampling subgraphs, Approximate counting} }
Keywords:  Sublinear time algorithms, Graph algorithms, Sampling subgraphs, Approximate counting  
Collection:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)  
Issue Date:  2021  
Date of publication:  15.09.2021 