The following pages link to Practical graph isomorphism. II. (Q2437295):
Displaying 50 items.
- Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree (Q5854457) (← links)
- Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory (Q5864695) (← links)
- Switching for Small Strongly Regular Graphs (Q5869433) (← links)
- A proof system for graph (non)-isomorphism verification (Q5883756) (← links)
- The Classification of Subfactors with Index at Most 5\frac{1}4 (Q5889060) (← links)
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness (Q5890037) (← links)
- On the enumeration of minimal non-pairwise compatibility graphs (Q5918254) (← links)
- On the enumeration of minimal non-pairwise compatibility graphs (Q5918527) (← links)
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties (Q5918849) (← links)
- An adaptive prefix-assignment technique for symmetry reduction (Q5919303) (← links)
- Enumerating Steiner triple systems (Q6064438) (← links)
- Cohen-Macaulay binomial edge ideals of small graphs (Q6066476) (← links)
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications (Q6071823) (← links)
- The smallest hard trees (Q6073305) (← links)
- The smallest 5-chromatic tournament (Q6076253) (← links)
- (Q6079211) (← links)
- On the multiplicities of distance Laplacian eigenvalues (Q6082257) (← links)
- Regular graphs of degree at most four that allow two distinct eigenvalues (Q6084879) (← links)
- Totally symmetric quasigroups of order 16 (Q6086215) (← links)
- (Q6089684) (← links)
- A taxonomy for similarity metrics between Markov decision processes (Q6097106) (← links)
- An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF (Q6113549) (← links)
- Polytope volume in Normaliz (Q6116629) (← links)
- Modular rewritable Petri nets: an efficient model for dynamic distributed systems (Q6120343) (← links)
- Complete minors in complements of nonseparating planar graphs (Q6132814) (← links)
- Graphs isomorphisms under edge-replacements and the family of amoebas (Q6133145) (← links)
- Statistics of Feynman amplitudes in \(\phi^4\)-theory (Q6142751) (← links)
- Enumeration of Latin squares with conjugate symmetry (Q6146183) (← links)
- Quasi-symmetric \(2\)-\((28,12,11)\) designs with an automorphism of order \(5\) (Q6146842) (← links)
- Steiner triple systems of order 21 with subsystems (Q6146847) (← links)
- Detection of common subtrees with identical label distribution (Q6150674) (← links)
- Maximum independent sets and supervised learning (Q6151016) (← links)
- \texttt{tapir}: a tool for topologies, amplitudes, partial fraction decomposition and input for reductions (Q6155468) (← links)
- pySecDec: a toolbox for the numerical evaluation of multi-scale integrals (Q6155745) (← links)
- Are hitting formulas hard for resolution? (Q6162037) (← links)
- On linear algebraic algorithms for the subgraph matching problem and its variants (Q6164954) (← links)
- Incomplete pairwise comparison matrices based on graphs with average degree approximately 3 (Q6165421) (← links)
- Comparison of Atom Maps (Q6167503) (← links)
- Wheels: a new criterion for non-convexity of neural codes (Q6170336) (← links)
- Realizable cycle structures in digraphs (Q6170805) (← links)
- Massively parallel computation of tropical varieties, their positive part, and tropical Grassmannians (Q6170811) (← links)
- Spectral theory of the non-backtracking Laplacian for graphs (Q6172286) (← links)
- A walk-regular graph, cospectral to its complement, need not be strongly regular (Q6172302) (← links)
- Classification of minimal blocking sets in PG(2,9) (Q6181318) (← links)
- Cographs and 1-sums (Q6184155) (← links)
- On the connectivity and the diameter of betweenness-uniform graphs (Q6184309) (← links)
- Ordering trees by \(\alpha\)-index (Q6184836) (← links)
- Colouring problems for symmetric configurations with block size 3 (Q6186660) (← links)
- Group divisible designs with block size 4 and group sizes 2 and 5 (Q6186985) (← links)
- The maximum number of columns in E(s2) $\,E({s}^{2})$‐optimal supersaturated designs with 16 rows and smax=4 ${s}_{{\rm{\max }}}=4$ is 60 (Q6187004) (← links)
