Info: Zenodo’s user support line is staffed on regular business days between Dec 23 and Jan 5. Response times may be slightly longer than normal.

Published June 20, 2023 | Version v3
Software Open

On the External Validity of Average-Case Analyses of Graph Algorithms (Data, Docker, and Code)

  • 1. Karlsruhe Institute of Technology
  • 2. Hasso Plattner Institute

Description

Here you find supplemental material for our paper

On the External Validity of Average-Case Analyses of Graph Algorithms.

Code

The source code and a description of how to use it can be found at github.com/thobl/external-validity. Additionally external-validity-main.zip contains a snapshot.

Docker Image

The easiest way to reproduce the experiments is to use the docker image ext_val.zip. Refer to github.com/thobl/external-validity for instructions how to use it.

Input Data: Networks from Network Repository

We use a set of 3006 networks from networkrepository.com [1]. Refer to our paper for more details on the data set.

[1] Ryan A. Rossi and Nesreen K. Ahmed, The Network Data Repository with Interactive Graph Analytics and Visualization (AAAI 2015)

Here we provide this data set in two formats. Use the first for reproducing our experiments. If you want to do your own experiments on the same networks, we recommend using the second.

  • input_data.zip contains the original graph as edge list (one edge per line) with no guarantees on where node indices start (usually at 0 or 1) or whether they are consecutive. The graphs might consist of multiple connected components.
  • edge_lists_real.zip contains the graphs reduced to their largest connected component. Node indices are consecutive starting at 0 and every edge is contained only for one direction.

Output Data: Generated Networks

The generated networks are provided as edge lists (one connected component, consecutive node indices starting at 0, every edge is contained only in one direction). They are grouped into different categories. For more details on the generated networks, refer to our paper.

  • cl stands for Chung-Lu graphs
  • er stands for Erdős-Rényi graphs
  • deg_20 indicates that the average degree is 20, otherwise it is 10
  • girg stands for geometric inhomogeneous  random graphs
  • girg_square means that a square was used as ground space, otherwise a torus was used
  • girg_deg_scaling contains girgs with various average degrees

Output Data: Computation Results

The raw data computed by our experiments is contained in output_data.zip. Additionally, there are three csv files summarizing all computed statistics for the networks.

Files

edge_lists_cl.zip

Files (4.3 GB)

Name Size Download all
md5:41a996ab7cdb0e94d11994b08ce59edd
44.0 MB Preview Download
md5:fd59f9ce60e2fa76520432d7abe443fd
86.3 MB Preview Download
md5:610ff532dffee4631fb2dcc35231f1da
4.8 MB Preview Download
md5:2d2c1611c633790cbb5a26383149de6c
9.4 MB Preview Download
md5:d0389736549e93c6f236b796504b5261
373.4 MB Preview Download
md5:ab02e1b17be81421efda31d7d42840ad
729.9 MB Preview Download
md5:80ab2e7fd5a55642c2714003507df7f7
1.0 GB Preview Download
md5:9d903771d2bd776829261c11fdf04f7c
347.6 MB Preview Download
md5:491bba1d0f96c02e44cc0d96ef8157b5
601.1 MB Preview Download
md5:809fb5b0616a5cba3de0539d3cb4559f
335.8 MB Preview Download
md5:a13e1348ac8150c5f0c502e09119c489
945.1 kB Preview Download
md5:d87b4a7ca9fdc96c881a3daa267662b2
2.3 MB Preview Download
md5:3b5e45e79efc9d655ad8c7cba90401f7
750.9 kB Preview Download
md5:84c1fe6eec74dfb62142d210b38d264e
1.2 MB Preview Download
md5:f6a635fedec64cc1bbf23cc2ece73be3
725.7 MB Preview Download
md5:b5f20ea926dd17209bfeb9c08993fe79
15.9 MB Preview Download

Additional details

Related works

Is supplement to
Preprint: arXiv:2205.15066 (arXiv)