TY - DATA
T1 - Source code underlying the publication: Optimal Graph Stretching for Distributed Averaging
PY - 2025/02/21
AU - Florine Dekker
AU - Zekeriya Erkin
AU - Mauro Conti
UR - 
DO - 10.4121/e64c61d3-deb5-4aad-af60-92d92755781f.v1
KW - Network optimization
KW - Distributed algorithms
KW - Network performance analysis
KW - Network dynamics
KW - Network simulations
KW - Measurement
KW - Performance
KW - High-girth graphs
KW - Short-cycle removal
KW - Cycle elimination
N2 - <p>MATLAB code to reproduce results presented in the paper "Optimal Graph Stretching for Distributed Averaging".</p><p><br></p><p>The source code is available as a git repository. Cached computation results are available as additional files.</p><p><br></p><p><strong>Git repository</strong></p><p>Relevant code is stored in the <code>StretchSim</code> directory.</p><p><br></p><p>Runs and visualises optimal graph stretching. The settings in <code>StretchSim.m</code> correspond exactly to the code that was executed to create the results in the paper. The code is fully deterministic and gives the exact same results as in the paper. By default, cached results are used.</p><p><br></p><p>See <code>ARTIFACT-EVALUATION.md</code> in the root folder for detailed end-user instructions.</p><p><br></p><p><strong>Files</strong></p><p>Cached computation results are optionally available, with filenames ending in <code>.cache.zip</code>. These allow inspecting the exact outputs without the need to re-run the computationally intensive experiments. Detailed usage instructions are available in the file <code>ARTIFACT-EVALUATION.md</code> inside the git repository.</p><p><br></p>
ER -