Source code underlying the publication: Privacy-Preserving Peer-to-Peer Cycle Detection
DOI: 10.4121/d23e6d7d-15d9-4c83-86de-5a3fc1fd5aa6
Datacite citation style
Software
Licence CC BY-SA 4.0
Interoperability
Python code to reproduce results presented in the paper "Privacy-Preserving Peer-to-Peer Cycle Detection".
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.
Usage
See README.md
inside the git repository for detailed usage instructions.
Code
The source code is available as a git repository. The relevant code is stored in the src
directory.
History
- 2025-06-17 first online, published, posted
Publisher
4TU.ResearchDataFormat
C++ code and Python codeCode hosting project url
https://github.com/junojense/bounded-private-cycle-detection.gitOrganizations
TU Delft, Faculty of Electrical Engineering, Mathematics and Computer Science, Department of Intelligent SystemsDATA
To access the source code, use the following command:
git clone https://data.4tu.nl/v3/datasets/d522e990-4a6d-4d3e-8665-0f319bf116ab.git "bounded-private-cycle-detection"
Files (1)
- 4,380 bytesMD5:
de44ed775f5de49b670722bb43623880
bounded-private-cycle-detection.out.zip