The following pages link to Practical graph isomorphism. II. (Q2437295):
Displaying 50 items.
- Traces (Q19839) (← links)
- The Schläfli Fan (Q161345) (← links)
- Biregular graphs with three eigenvalues (Q281935) (← links)
- Binary determinantal complexity (Q286175) (← links)
- Further results on the classification of MDS codes (Q326328) (← links)
- Constructions and bounds for mixed-dimension subspace codes (Q326349) (← links)
- Generalized Ramsey numbers through adiabatic quantum optimization (Q331397) (← links)
- On maximal relative projection constants (Q335420) (← links)
- Optimal-depth sorting networks (Q340576) (← links)
- Lower bounds for locally highly connected graphs (Q343698) (← links)
- Switching in one-factorisations of complete graphs (Q405262) (← links)
- On hypercube packings, blocking sets and a covering problem (Q477608) (← links)
- Obstructions to convexity in neural codes (Q504424) (← links)
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions (Q516870) (← links)
- Mappings of Butson-type Hadamard matrices (Q724843) (← links)
- On Ryser's conjecture for linear intersecting multipartite hypergraphs (Q730257) (← links)
- New quasi-symmetric designs by the Kramer-Mesner method (Q738841) (← links)
- Generating all finite modular lattices of a given size (Q745707) (← links)
- Kirkman triple systems with subsystems (Q776280) (← links)
- A nonexistence certificate for projective planes of order ten with weight 15 codewords (Q780361) (← links)
- On the number of frequency hypercubes \(F^n(4;2,2) \) (Q820504) (← links)
- Quasi-symmetric designs on 56 points (Q825929) (← links)
- Comparing Wiener complexity with eccentric complexity (Q827592) (← links)
- Exploiting symmetries in mathematical programming via orbital independence (Q829174) (← links)
- Characterization and classification of optimal LCD codes (Q831153) (← links)
- Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four (Q831869) (← links)
- 16,051 formulas for Ottaviani's invariant of cubic threefolds (Q897786) (← links)
- Variable symmetry breaking in numerical constraint problems (Q900305) (← links)
- Affine symmetries of orbit polytopes (Q900854) (← links)
- Integer sequence discovery from small graphs (Q908306) (← links)
- Detecting almost symmetries of graphs (Q1621684) (← links)
- Oriented chromatic number of Cartesian products and strong products of paths (Q1630938) (← links)
- The QAP-polytope and the graph isomorphism problem (Q1631655) (← links)
- Perturbations in a signed graph and its index (Q1649918) (← links)
- On panel-regular \(\tilde{A}_2\) lattices (Q1681812) (← links)
- Six variations on a theme: almost planar graphs (Q1684551) (← links)
- Counting arcs in projective planes via Glynn's algorithm (Q1685543) (← links)
- Enumeration of Seidel matrices (Q1686262) (← links)
- There is no McLaughlin geometry (Q1689033) (← links)
- The resistance perturbation distance: a metric for the analysis of dynamic networks (Q1693161) (← links)
- Turán numbers for odd wheels (Q1699569) (← links)
- Network alignment by discrete Ollivier-Ricci flow (Q1725779) (← links)
- The sextuply shortened binary Golay code is optimal (Q1727350) (← links)
- On a family of highly regular graphs by Brouwer, Ivanov, and Klin (Q1732770) (← links)
- Computing subfields of number fields and applications to Galois group computations (Q1733297) (← links)
- Enumeration of 2-level polytopes (Q1741129) (← links)
- On the \(A_{\alpha}\)-characteristic polynomial of a graph (Q1743145) (← links)
- Binomial edge ideals of bipartite graphs (Q1746565) (← links)
- Counting Markov equivalence classes for DAG models on trees (Q1752602) (← links)
- Minimal and canonical images (Q1755579) (← links)
