Title of program: PERMID Catalogue Id: ACQP_v1_0 Nature of problem For a given set of N objects where lambda1, lambda2, ..., lambdap are identical, we give an algorithm which generates all the d
This data set collectes all globally rigid graphs for dimension d<=25 with at most d+k vertices, where k might be different. The graphs are collected in a zip file with respect to the dimension