A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: S. Assadi, M. Kapralov, S. Khanna

Journal title: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019)

Journal publisher: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019)

Published year: 2019

DOI identifier: 10.4230/lipics.itcs.2019.6