The following pages link to bliss (Q33598):
Displaying 41 items.
- polyDB: A Database for Polytopes and Related Objects (Q161321) (← links)
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants (Q360469) (← links)
- Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips (Q412338) (← links)
- Isomorphism testing via polynomial-time graph extensions (Q662128) (← links)
- Uniform semi-Latin squares and their pairwise-variance aberrations (Q830735) (← links)
- Distributed discovery of frequent subgraphs of a network using MapReduce (Q889838) (← links)
- Symmetric blocking (Q897931) (← links)
- A computational approach to construct a multivariate complete graph invariant (Q903598) (← links)
- Integer sequence discovery from small graphs (Q908306) (← links)
- DiscreteZOO: towards a fingerprint database of discrete objects (Q1662198) (← links)
- A computational comparison of symmetry handling methods for mixed integer programs (Q1741126) (← links)
- Efficient modularity density heuristics for large graphs (Q1751717) (← links)
- Minimal and canonical images (Q1755579) (← links)
- There is no (75,32,10,16) strongly regular graph (Q1790457) (← links)
- Optimal symmetry breaking for graph problems (Q2009225) (← links)
- Permutation group algorithms based on directed graphs (Q2042953) (← links)
- Classical symmetries and the quantum approximate optimization algorithm (Q2099573) (← links)
- On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
- Enumerating partial Latin rectangles (Q2188838) (← links)
- Packing, partitioning, and covering symresacks (Q2192122) (← links)
- DiscreteZOO: a fingerprint database of discrete objects (Q2209260) (← links)
- CDCLSym: introducing effective symmetry breaking in SAT solving (Q2324209) (← links)
- Novel techniques to speed up the computation of the automorphism group of a graph (Q2336847) (← links)
- Characterization of symmetry of complex networks (Q2338050) (← links)
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures (Q2360872) (← links)
- Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207) (← links)
- Practical graph isomorphism. II. (Q2437295) (← links)
- Improved Static Symmetry Breaking for SAT (Q2818005) (← links)
- Logic Programming with Graph Automorphism: Integrating<tt>nauty</tt>with Prolog (Tool Description) (Q4593050) (← links)
- Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (Q4635884) (← links)
- Error Thresholds for Arbitrary Pauli Noise (Q4957914) (← links)
- Graph Similarity and Approximate Isomorphism (Q5005120) (← links)
- Isomorphism and Invariants of Parallelisms of Projective Spaces (Q5039568) (← links)
- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming (Q5041755) (← links)
- Benchmark Graphs for Practical Graph Isomorphism (Q5111749) (← links)
- Isomorphism Test for Digraphs with Weighted Edges. (Q5140741) (← links)
- STUDY OF GRAPH ISOMORPHISM USING JORDAN FORMS OF ADJACENCY MATRICES (Q5151220) (← links)
- Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs (Q5233500) (← links)
- (Q5358292) (← links)
- (Q5454406) (← links)
- An adaptive prefix-assignment technique for symmetry reduction (Q5919303) (← links)
