Engineering a Delegatable and Error-Tolerant Algorithm for Counting Small Subgraphs

DOI10.1137/1.9781611975055.16zbMath1430.68221OpenAlexW2782346863MaRDI QIDQ5232737

Petteri Kaski

Publication date: 12 September 2019

Published in: 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975055.16

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Uses Software

• CUDA
• DOULION
• six-subgraph

This page was built for publication: Engineering a Delegatable and Error-Tolerant Algorithm for Counting Small Subgraphs