Revisiting Link Prioritization for Efficient Traversal in Structured Decentralized Environments
From MaRDI portal
DOI10.5281/zenodo.14531949Zenodo14531949MaRDI QIDQ6719700
Dataset published at Zenodo repository.
Author name not available (Why is that?)
Publication date: 19 December 2024
Copyright license: No records found.
These files are the benchmark results produced for the analysis in the paper: "Revisiting Link Prioritization forEfficient Traversal in Structured DecentralizedEnvironments". These include the timing runs without $R^{3}$ tracking, five $R^{3}$ runs for the diefficiency, and one run for calculating the $R^{3}$. To process this data you can use and follow the instructions from this repository.
This page was built for dataset: Revisiting Link Prioritization for Efficient Traversal in Structured Decentralized Environments