"A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via ..."

Sepehr Assadi, Michael Kapralov, Sanjeev Khanna (2019)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ITCS.2019.6

access: open

type: Conference or Workshop Paper

metadata version: 2024-10-06

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/innovations/AssadiKK19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/innovations/AssadiKK19
Sepehr Assadi, Michael Kapralov, Sanjeev Khanna:
A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling. ITCS 2019: 6:1-6:20

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.