Submission

Prepare a graph file for each of your graphs. See below for the file format.

Decide whether you disclose the graphs before the deadline. If you choose to do so, your graph files will be downloadable on the ranking page. If you choose not, only the properties ((h)diameter, (h)ASPL, etc.) will be displayed. All the graph files will be made available for downloads after the deadline.

Decide whether you disclose the program you used for creating the graphs. If you choose to do so, make sure (1) you have a necessary right to make it open to the public, and (2) you have no secret information (e.g. passwords) in it.

(optional) Write a brief description of the algorithm you used for creating the graphs.

Go to the entry form, fill it out and submit.
Open: 20210427 00:00 UTC
Deadline: 20211011 23:59 UTC Closed
Go to the entry form
Graph file format

A graph file must be in an edge list format compatible with the NetworkX's read_edgelist function. Edge attributes will be ignored if exist.

For a general graph, each vertex name must be an integer starting from zero.

For a hostswitch graph, the first line describes the three parameters: n (the number of hosts), m (the number of switches), and r (the number ports of each switch, namely radix). The host vertices must be integers 0, 1, 2, ..., n2, n1. The switch vertices must be integers n, n + 1, n + 2, ..., n+m2, n+m1. The second line and later follows the same edge list format as the general graph.