Dataset Open Access

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

Capco, Jose; Gallet, Matteo; Grasegger, Georg; Koutschan, Christoph; Lubbes, Niels; Schicho, Josef

Data manager(s)
Grasegger, Georg

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).

Files (346.5 MB)
Name Size
Description.txt
md5:0319b442ea81a8fc1500f66ae463d3f7
2.5 kB Download
LamanGraphs11.zip
md5:392c790c3e8d06a4cbc15af66bb1ab54
12.6 MB Download
LamanGraphs12.zip
md5:2cd4dd36a1d405ddcbdd22b981876201
311.5 MB Download
LamanGraphs3-10.zip
md5:d5985faa37d30ef90448db2257040aee
650.2 kB Download
Realizations11.zip
md5:58cde706edb05548c1e221b3df9ca418
786.2 kB Download
Realizations12.zip
md5:6bf74d6229931b8f5eeb33391a893da4
20.9 MB Download
Realizations3-10.zip
md5:ccc35235909d6b76f20daf07e0a5b50e
40.5 kB Download
  • J. Capco, M. Gallet, G. Grasegger, C. Koutschan, N. Lubbes, and J. Schicho. The number of realizations of a Laman graph. SIAM Journal on Applied Algebra and Geometry, 2(1):94–125, 2018, doi: 10.1137/17M1118312

  • J. Capco, M. Gallet, G. Grasegger, C. Koutschan, N. Lubbes, and J. Schicho. An algorithm for computing the number of realizations of a Laman graph, doi: 10.5281/zenodo.1245506

328
285
views
downloads
All versions This version
Views 328330
Downloads 285285
Data volume 13.8 GB13.8 GB
Unique views 300302
Unique downloads 9191

Share

Cite as