Pages that link to "Item:Q5233500"

The following pages link to Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs (Q5233500):

Displaying 33 items.

• Non-existence of a ternary constant weight \((16,5,15;2048)\) diameter perfect code (Q326314) (← 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)
• 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)
• 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)
• Enumerating partial Latin rectangles (Q2188838) (← links)
• DiscreteZOO: a fingerprint database of discrete objects (Q2209260) (← links)
• Novel techniques to speed up the computation of the automorphism group of a graph (Q2336847) (← 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)
• Logic Programming with Graph Automorphism: Integrating<tt>nauty</tt>with Prolog (Tool Description) (Q4593050) (← 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)
• (Q5091279) (← links)
• Symmetry-driven network reconstruction through pseudobalanced coloring optimization (Q5101076) (← links)
• Isomorphism Test for Digraphs with Weighted Edges. (Q5140741) (← links)
• STUDY OF GRAPH ISOMORPHISM USING JORDAN FORMS OF ADJACENCY MATRICES (Q5151220) (← links)
• A Generic Framework for Engineering Graph Canonization Algorithms (Q5232733) (← links)
• An adaptive prefix-assignment technique for symmetry reduction (Q5919303) (← links)
• Fast computation of the centralizer of a permutation group in the symmetric group (Q6149148) (← links)
• Corners and simpliciality in oriented matroids and partial cubes (Q6171497) (← links)
• A census of small Schurian association schemes (Q6195303) (← links)