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 made available for download on the ranking page. If you choose not, only the properties (diameter, ASPL, etc.) will be displayed. All graphs will be made downloadable after the deadline.
- Decide whether you disclose the program you used for creating the graph files. 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.
Deadline: 2016-09-25 23:59 UTC Closed
Graph file format
A graph file must be in an edge list format compatible with NetworkX's read_edgelist function. The vertex names must be integer starting from zero. Edge attributes will be ignored if exist.
Example: The 2x3-mesh graph on the left-hand side is represented by the edge list file on the right-hand side.
| A 2x3-mesh graph | An edge list file |
|---|---|
|
0 1 |