TCS / Software / bliss / benchmarks

Benchmark graphs for evaluating graph automorphism and canonical labeling algorithms

Note: If you have additional benchmark graphs that you would like to share with us, please feel free to contact me.

Note 2: Please notice that the graphs in each benchmark family are not quaranteed to be pairwise non-isomorphic. For instance, the family "had-sw" contains isomorphic graphs. Thanks to Pascal Schweitzer for notifying us about this fact.

Undirected graphs

Directed graphs

There are no directed graphs available yet.
[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links]
Latest update: 01 April 2009. Tommi Junttila