swMATH21797MaRDI QIDQ33598FDOQ33598
Author name not available (Why is that?)
Official website: http://www.tcs.hut.fi/Software/bliss/
Cited In (only showing first 100 items - show all)
- MiniSym
- Classical symmetries and the quantum approximate optimization algorithm
- Novel techniques to speed up the computation of the automorphism group of a graph
- Tight lower and upper bounds for the complexity of canonical colour refinement
- Error thresholds for arbitrary Pauli noise
- On generalized surrogate duality in mixed-integer nonlinear programming
- Optimal symmetry breaking for graph problems
- Study of graph isomorphism using Jordan forms of adjacency matrices
- Title not available (Why is that?)
- relaxation_complexity
- There is no (75,32,10,16) strongly regular graph
- On generalized surrogate duality in mixed-integer nonlinear programming
- Vole
- Isomorphism test for digraphs with weighted edges
- Benchmark Graphs for Practical Graph Isomorphism
- Packing, partitioning, and covering symresacks
- Graph similarity and approximate isomorphism
- CDCLSym: introducing effective symmetry breaking in SAT solving
- DiscreteZOO: a fingerprint database of discrete objects
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
- Permutation group algorithms based on directed graphs
- Uniform semi-Latin squares and their pairwise-variance aberrations
- Practical graph isomorphism. II.
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
- Improved static symmetry breaking for SAT
- A computational comparison of symmetry handling methods for mixed integer programs
- Isomorphism and invariants of parallelisms of projective spaces
- Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips
- Enumerating partial Latin rectangles
- Efficient modularity density heuristics for large graphs
- A computational approach to construct a multivariate complete graph invariant
- Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description)
- Distributed discovery of frequent subgraphs of a network using MapReduce
- GDToolkit
- cddplus
- Cliquer
- Max-AO
- GRAPE
- LPAm+
- DESIGN
- QuACN
- VNDS
- Traces
- SmallGroups Library
- PermLib
- Graded Ring Database
- HTab
- Orbiter
- QMG
- FindStat
- IMAGINARY
- Saucy
- 01poly
- MedOlDatschgerl
- QuickHull3D
- Symmetric blocking
- nishe
- SageSAT
- CaGe
- Shatter
- Cocone
- CompuTop
- DGD gallery
- Detri
- GEOMETRICA
- GeoCalcLib
- Glop
- IJK
- Polyominoes
- Trelis
- VaryLab
- VisPak
- birkhoff faces
- pl-nauty
- Digraphs
- GraPHedron
- DiscreteZOO
- GENREG
- lattice_normalization
- sage-drg
- polymake_smooth_fano
- conauto
- geng
- Small Graph Database
- Ferret
- images
- snarkhunter
- Triangleramsey
- PrimGrp
- HGen
- TransGrp
- GraphCanon
- PermGroup
- reduce
- MLSVM
- pls.lib
- Gavrog
- GRADPART
- Systre
- BacktrackKit
This page was built for software: bliss
