bliss: A Tool for Computing Automorphism Groups and Canonical Labelings of Graphs. bliss is an open source tool for computing automorphism groups and canonical forms of graphs. It has both a command line user interface as well as C++ and C programming language APIs.
Keywords for this software
References in zbMATH (referenced in 10 articles )
Showing results 1 to 10 of 10.
- Bailey, R. A.; Soicher, Leonard H.: Uniform semi-Latin squares and their pairwise-variance aberrations (2021)
- Berčič, Katja; Vidali, Janoš: DiscreteZOO: a fingerprint database of discrete objects (2020)
- Firsching, Moritz: The complete enumeration of 4-polytopes and 3-spheres with nine vertices (2020)
- Hojny, Christopher: Packing, partitioning, and covering symresacks (2020)
- Pfetsch, Marc E.; Rehn, Thomas: A computational comparison of symmetry handling methods for mixed integer programs (2019)
- Berčič, Katja; Vidali, Janoš: DiscreteZOO: towards a fingerprint database of discrete objects (2018)
- Paffenholz, Andreas: \textttpolyDB: a database for polytopes and related objects (2017)
- Toth, Csaba D. (ed.); Goodman, Jacob E. (ed.); O’Rourke, Joseph (ed.): Handbook of discrete and computational geometry (2017)
- McKay, Brendan D.; Piperno, Adolfo: Practical graph isomorphism. II. (2014)
- Brinkmann, G.; Fowler, P. W.: A list of free software for chemical and graph theoretical applications (2007)