The number of realizations of all Laman graphs with at most 12 vertices

This data set consists of files for all Laman graphs (minimally rigid graphs) with at most 12 vertices and files for their Laman numbers (number of complex relaizations). The data is computed by a combinatorial algorithm of Capco, Gallet, Grasegger, Koutschan, Lubbes and Schicho (see 10.1137/17M1118312 for a description and 10.5281/zenodo.1245506 for an implementation).