Engineering a delegatable and error-Tolerant algorithm for counting small subgraphs

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

2 Citations (Scopus)
41 Downloads (Pure)


We study the problem of counting the number of occurrences of a given six-vertex pattern graph S in an n-vertex host graph H. We engineer an open-source GPU implementation of a distributed algorithm design of Björklund and Kaski [PODC 2016] where (i) the execution of the algorithm can be delegated [Goldwasser, Kalai, and Rothblum, J. ACM 2015] to produce a noninteractive probabilistically checkable proof of correctness, and (ii) the execution of the algorithm when preparing the proof tolerates a controllable number of adversarial errors. Experiments with NVIDIA Tesla K80 and Tesla P100 Accelerators demonstrate that the framework is practical for inputs of up to 512 vertices, with proof checking being several orders of magnitude more efficient than preparing the proof; however, proof preparation still carries at least one order of magnitude overhead compared with just solving the problem.

Original languageEnglish
Title of host publication2018 Proceedings of the 20th Workshop on Algorithm Engineering and Experiments, ALENEX 2018
PublisherSociety for Industrial and Applied Mathematics
Number of pages15
ISBN (Electronic)9781611975055
Publication statusPublished - 2018
MoE publication typeA4 Article in a conference publication
EventWorkshop on Algorithm Engineering and Experiments - New Orleans, United States
Duration: 7 Jan 20188 Jan 2018
Conference number: 20


WorkshopWorkshop on Algorithm Engineering and Experiments
Abbreviated titleALENEX
Country/TerritoryUnited States
CityNew Orleans


Dive into the research topics of 'Engineering a delegatable and error-Tolerant algorithm for counting small subgraphs'. Together they form a unique fingerprint.

Cite this