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

DOI10.1137/1.9781611975055.16MaRDI QIDQ5232737zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Detecting and counting small pattern graphs
• Detecting and Counting Small Pattern Graphs
• Faster algorithms for counting subgraphs in sparse graphs
• Counting and detecting small subgraphs via equations
• How proofs are prepared at Camelot (extended abstract)

Cited in

(1)

• How proofs are prepared at Camelot (extended abstract)

Describes a project that uses

Uses Software

• six-subgraph
• DOULION
• CUDA

This page was built for publication: Engineering a delegatable and error-tolerant algorithm for counting small subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232737)