Automorphism group
Miscellanea
-
Graphs of Combinatorial Structures
bliss nauty conauto saucy Tracesupdated Nov 22, 2012
Graph (V,E) Orbits Group Size C1 (3650, 598600) 30 324 C2 (15984,10725264) 2 2,125,873,200 C3 (7300,2693700) 2 188,956,800 C4 (2752,481600) 2 38,723,328 C5 (900000,1200000) 2 600,000 Graph (V,E) Orbits Group Size C6 (15984,10725264) 2 231,913,440 C7 (3650,598600) 65 72 C8 (3276,245700) 3 9,000,000 C9 (756,49140) 2 9,000,000 Timeline
Details of Recent Experiments
All experiments have been run on a MacBookPro (retina), Intel Core i7, 2.66 GHz, 16GB ram, under gcc4.7.
bliss 0.72
nauty 25rc1
conauto 2.0.1saucy 3.0
Traces 2.0 -
CNF Formula Graphs
bliss nauty conauto saucy Tracesupdated Nov 22, 2012
The dac family from saucy benchmarks distribution. Graphs are grouped by number of vertices.Timeline
Details of Recent Experiments
All experiments have been run on a MacBookPro (retina), Intel Core i7, 2.66 GHz, 16GB ram, under gcc4.7.
bliss 0.72
nauty 25rc1
conauto 2.0.1saucy 3.0
Traces 2.0 -
Non-disjoint union of tripartite graphs
bliss nauty conauto saucy Tracesupdated Nov 22, 2012
The tnn family from conauto benchmarks distribution. Graphs are grouped by number of vertices. These are component-based graphs. At present, nauty and Traces do not have any special mechanism for detecting components in graphs.Timeline
Details of Recent Experiments
All experiments have been run on a MacBookPro (retina), Intel Core i7, 2.66 GHz, 16GB ram, under gcc4.7.
bliss 0.72
nauty 25rc1
conauto 2.0.1saucy 3.0
Traces 2.0