I need to compute **canonical forms** of *many* (~10^6-10^8) vertex-facets incidence graphs of polytope. Two rather big examples I want to consider are


* the [600-cell](https://en.wikipedia.org/wiki/600-cell) with 120 vertices and 600 facets (dimension 4), and
* the smallest known [counter example](https://sites.google.com/site/christopheweibel/research/hirsch-conjecture) to the Hirsch bound with 40 vertices and 36426 facets (dimension 20).


The two options that seem to be best suited to compute these canonical forms are [nauty](http://www3.cs.stonybrook.edu/~algorith/implement/nauty/implement.shtml) and [bliss](http://www.tcs.hut.fi/Software/bliss/).
My questions are


* Is there another option that I have overseen?
* I have not found any benchmark comparisons between the two, so should I prefer one over the other?
* Does the property of being bipartite make a difference in which to choose?


Many Thanks! -- this is not a strictly mathematical question, but I hope it is still suitable here.


The graphs that are test cases can be found in dreadnaut format here: [counter example to the Hirsch conjecture](https://drive.google.com/file/d/0B1POEh8bhq1fajBOOXhYcjRIblU/view?usp=sharing), [600-cell](https://drive.google.com/open?id=0B1POEh8bhq1fUkpSMWJBaFNVajQ), and [1000 typical examples](https://drive.google.com/file/d/0B1POEh8bhq1fRTBDX0lvVG00dlk/view?usp=sharing).



Comparison nauty vs. bliss of canonical form of bipartite graphs
You can find a comparison at <http://pallini.di.uniroma1.it> under the "experiments" link, and Traces is there too. It's hard to tell in advance what will work best. Either your graphs are like typical graphs of these sizes, in which case all the algorithms will be fast enough, or they are much harder, in which case some care is needed. If you send me a handful of typical examples in one of the two formats that are used at <http://pallini.di.uniroma1.it/Graphs.html> , I will give more precise advice. 


