bliss

swMATH21797MaRDI QIDQ33598

No author found.

Related Items (41)

Combining SAT solvers with computer algebra systems to verify combinatorial conjectures ⋮ Isomorphism and Invariants of Parallelisms of Projective Spaces ⋮ On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming ⋮ Uniform semi-Latin squares and their pairwise-variance aberrations ⋮ Unnamed Item ⋮ Tight lower and upper bounds for the complexity of canonical colour refinement ⋮ DiscreteZOO: towards a fingerprint database of discrete objects ⋮ An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants ⋮ Distributed discovery of frequent subgraphs of a network using MapReduce ⋮ Enumerating partial Latin rectangles ⋮ Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description) ⋮ Packing, partitioning, and covering symresacks ⋮ Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips ⋮ Symmetric blocking ⋮ A computational approach to construct a multivariate complete graph invariant ⋮ Integer sequence discovery from small graphs ⋮ Practical graph isomorphism. II. ⋮ DiscreteZOO: a fingerprint database of discrete objects ⋮ Isomorphism testing via polynomial-time graph extensions ⋮ Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic ⋮ Graph Similarity and Approximate Isomorphism ⋮ STUDY OF GRAPH ISOMORPHISM USING JORDAN FORMS OF ADJACENCY MATRICES ⋮ A computational comparison of symmetry handling methods for mixed integer programs ⋮ Efficient modularity density heuristics for large graphs ⋮ Minimal and canonical images ⋮ Optimal symmetry breaking for graph problems ⋮ Benchmark Graphs for Practical Graph Isomorphism ⋮ An adaptive prefix-assignment technique for symmetry reduction ⋮ There is no (75,32,10,16) strongly regular graph ⋮ Unnamed Item ⋮ Error Thresholds for Arbitrary Pauli Noise ⋮ Permutation group algorithms based on directed graphs ⋮ Improved Static Symmetry Breaking for SAT ⋮ polyDB: A Database for Polytopes and Related Objects ⋮ Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs ⋮ CDCLSym: introducing effective symmetry breaking in SAT solving ⋮ Novel techniques to speed up the computation of the automorphism group of a graph ⋮ Characterization of symmetry of complex networks ⋮ Classical symmetries and the quantum approximate optimization algorithm ⋮ Isomorphism Test for Digraphs with Weighted Edges. ⋮ On generalized surrogate duality in mixed-integer nonlinear programming

This page was built for software: bliss