bliss

swMATH21797MaRDI QIDQ33598FDOQ33598

Author name not available (Why is that?)

Cited In (41)

• Classical symmetries and the quantum approximate optimization algorithm
• 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.
• 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
• An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
• 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
• Isomorphism and invariants of parallelisms of projective spaces
• Study of graph isomorphism using Jordan forms of adjacency matrices
• Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips
• Title not available (Why is that?)
• Enumerating partial Latin rectangles
• Efficient modularity density heuristics for large graphs
• Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic
• 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
• There is no (75,32,10,16) strongly regular graph
• Symmetric blocking
• Integer sequence discovery from small graphs
• An adaptive prefix-assignment technique for symmetry reduction
• On generalized surrogate duality in mixed-integer nonlinear programming
• Isomorphism test for digraphs with weighted edges
• Benchmark Graphs for Practical Graph Isomorphism
• Packing, partitioning, and covering symresacks
• Title not available (Why is that?)
• Engineering an efficient canonical labeling tool for large and sparse graphs
• Minimal and canonical images
• Isomorphism testing via polynomial-time graph extensions
• DiscreteZOO: towards a fingerprint database of discrete objects
• Graph similarity and approximate isomorphism
• CDCLSym: introducing effective symmetry breaking in SAT solving
• \texttt{polyDB}: a database for polytopes and related objects
• Characterization of symmetry of complex networks

This page was built for software: bliss