cff-version: 1.2.0
abstract: "<p>Python code to reproduce results presented in the paper "Privacy-Preserving Peer-to-Peer Cycle Detection".</p><p><br></p><p>Runs an implementation of the distributed cycle detection protocol and measures its runtime and communication performance. Performance is measured on randomly generated Barabási–Albert graphs for a range of graph densities and searched-for cycle lengths. For each graph, the protocol is repeated in its entirety for each node. Average results for each set of input parameters are written to a CSV file, which can be plotted in figures using the included code.</p><p><br></p><p><strong>Usage</strong></p><p>See <code>README.md</code> inside the git repository for detailed usage instructions.</p><p><br></p><p><strong>Code</strong></p><p>The source code is available as a git repository. The relevant code is stored in the <code>src</code> directory.</p><p><br></p>"
authors:
  - family-names: Jense
    given-names: Juno
    orcid: "https://orcid.org/0009-0000-2339-1479"
  - family-names: Dekker
    given-names: Florine
    orcid: "https://orcid.org/0000-0002-0506-7365"
title: "Source code underlying the publication: Privacy-Preserving Peer-to-Peer Cycle Detection"
keywords:
version: 1
identifiers:
  - type: doi
    value: 10.4121/d23e6d7d-15d9-4c83-86de-5a3fc1fd5aa6.v1
license: CC BY-SA 4.0
date-released: 2025-06-17