## Abstract

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 language | English |
---|---|

Title of host publication | 2018 Proceedings of the 20th Workshop on Algorithm Engineering and Experiments, ALENEX 2018 |

Publisher | Society for Industrial and Applied Mathematics |

Pages | 184-198 |

Number of pages | 15 |

Volume | 2018-January |

ISBN (Electronic) | 9781611975055 |

DOIs | |

Publication status | Published - 2018 |

MoE publication type | A4 Article in a conference publication |

Event | Workshop on Algorithm Engineering and Experiments - New Orleans, United States Duration: 7 Jan 2018 → 8 Jan 2018 Conference number: 20 |

### Workshop

Workshop | Workshop on Algorithm Engineering and Experiments |
---|---|

Abbreviated title | ALENEX |

Country/Territory | United States |

City | New Orleans |

Period | 07/01/2018 → 08/01/2018 |