The following pages link to Practical graph isomorphism. II. (Q2437295):
Displaying 50 items.
- On tail dependence matrices. The realization problem for parametric families (Q2191424) (← links)
- A model for finding transition-minors (Q2192081) (← links)
- Packing, partitioning, and covering symresacks (Q2192122) (← links)
- Counting frequent patterns in large labeled graphs: a hypergraph-based approach (Q2194034) (← links)
- Intersection graph of maximal stars (Q2197473) (← links)
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach (Q2200659) (← links)
- A note on universal point sets for planar graphs (Q2206869) (← links)
- DiscreteZOO: a fingerprint database of discrete objects (Q2209260) (← links)
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results (Q2216123) (← links)
- Generalized spectral characterization of mixed graphs (Q2223447) (← links)
- Star-critical Ramsey numbers for cycles versus \(K_4\) (Q2227100) (← links)
- Biangular lines revisited (Q2230922) (← links)
- Group theory on quantum Boltzmann machine (Q2233057) (← links)
- Cops and robbers on \(2K_2\)-free graphs (Q2237234) (← links)
- The cone of quasi-semimetrics and exponent matrices of tiled orders (Q2237237) (← links)
- On the resistance diameters of graphs and their line graphs (Q2243147) (← links)
- On trees with algebraic connectivity greater than or equal to \(2(1-\cos(\frac{\pi}{7}))\) (Q2245762) (← links)
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187) (← links)
- On stepwise transmission irregular graphs (Q2246445) (← links)
- Inheritance of oscillation in chemical reaction networks (Q2279240) (← links)
- Generating modular lattices of up to 30 elements (Q2279675) (← links)
- On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays (Q2279982) (← links)
- Constructing unlabelled lattices (Q2282992) (← links)
- Obstructions for three-coloring graphs without induced paths on six vertices (Q2284725) (← links)
- On the volumes and affine types of trades (Q2290357) (← links)
- On the upper embedding of symmetric configurations with block size 3 (Q2297727) (← links)
- Refining invariants for computing autotopism groups of partial Latin rectangles (Q2305926) (← links)
- On unbalanced Boolean functions with best correlation immunity (Q2309213) (← links)
- Generalized permanental polynomials of graphs (Q2311039) (← links)
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935) (← links)
- On the minimum leaf number of cubic graphs (Q2324488) (← links)
- Calculating the symmetry number of flexible sphere clusters (Q2327829) (← links)
- Optimal packings of two to four equal circles on any flat torus (Q2329183) (← links)
- Constraints for symmetry breaking in graph representation (Q2331101) (← links)
- Novel techniques to speed up the computation of the automorphism group of a graph (Q2336847) (← links)
- The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes (Q2341750) (← links)
- nauty in Macaulay2 (Q2345714) (← links)
- Algorithms for finding generalized minimum aberration designs (Q2349095) (← links)
- Distinguishing graphs with zeta functions and generalized spectra (Q2349996) (← links)
- Exhaustive search for snake-in-the-box codes (Q2354613) (← links)
- On the bivariate permanent polynomials of graphs (Q2361557) (← links)
- Isotropic matroids. III: Connectivity (Q2363112) (← links)
- Regularity and planarity of token graphs (Q2364080) (← links)
- The uniqueness of a distance-regular graph with intersection array \(\{32,27,8,1;1,4,27,32\}\) and related results (Q2364627) (← links)
- Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207) (← links)
- Combinatorial reductions for the Stanley depth of \(I\) and \(S/I\) (Q2401434) (← links)
- Minimal extending sets in tournaments (Q2406936) (← links)
- Almost equitable partitions and new necessary conditions for network controllability (Q2407159) (← links)
- Baby-step giant-step algorithms for the symmetric group (Q2409009) (← links)
- Filtering graphs to check isomorphism and extracting mapping by using the conductance electrical model (Q2418739) (← links)
