Cited in
(only showing first 100 items - show all)- Isomorphism test for digraphs with weighted edges
- Benchmark Graphs for Practical Graph Isomorphism
- Packing, partitioning, and covering symresacks
- Isomorphism testing via polynomial-time graph extensions
- Minimal and canonical images
- scientific article; zbMATH DE number 6776481 (Why is no real title available?)
- Engineering an efficient canonical labeling tool for large and sparse graphs
- DiscreteZOO: towards a fingerprint database of discrete objects
- CDCLSym: introducing effective symmetry breaking in SAT solving
- Graph similarity and approximate isomorphism
- relaxation_complexity
- Characterization of symmetry of complex networks
- polyDB: a database for polytopes and related objects
- Classical symmetries and the quantum approximate optimization algorithm
- DiscreteZOO: a fingerprint database of discrete objects
- Permutation group algorithms based on directed graphs
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
- Uniform semi-Latin squares and their pairwise-variance aberrations
- Practical graph isomorphism. II.
- 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
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
- Error thresholds for arbitrary Pauli noise
- On generalized surrogate duality in mixed-integer nonlinear programming
- Optimal symmetry breaking for graph problems
- Improved static symmetry breaking for SAT
- A computational comparison of symmetry handling methods for mixed integer programs
- Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips
- Isomorphism and invariants of parallelisms of projective spaces
- Study of graph isomorphism using Jordan forms of adjacency matrices
- Enumerating partial Latin rectangles
- Efficient modularity density heuristics for large graphs
- scientific article; zbMATH DE number 5255703 (Why is no real title available?)
- A computational approach to construct a multivariate complete graph invariant
- Distributed discovery of frequent subgraphs of a network using MapReduce
- nauty
- SymChaff
- 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
- 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
- Gavrog
- GRADPART
This page was built for software: bliss
