The following pages link to (Q3671211):
Displaying 50 items.
- A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges (Q298954) (← links)
- A polynomial representation and a unique code of a simple undirected graph (Q361581) (← links)
- Polynomial algorithms for open plane graph and subgraph isomorphisms (Q391207) (← links)
- The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\) (Q396940) (← links)
- Switching in one-factorisations of complete graphs (Q405262) (← links)
- Orbitopal fixing (Q408377) (← links)
- Improving constrained pattern mining with first-fail-based heuristics (Q408638) (← links)
- Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips (Q412338) (← links)
- A matching algorithm between precursory 3D process model and 2D working procedure drawing based on subgraph isomorphism (Q413023) (← links)
- Automorphism groups of the Pancake graphs (Q413293) (← links)
- Locally constrained graph homomorphisms -- structure, complexity, and applications (Q458463) (← links)
- kLog: a language for logical and relational learning with kernels (Q464624) (← links)
- Symmetry in world trade network (Q473029) (← links)
- Using local similarity measures to efficiently address approximate graph matching (Q496650) (← links)
- Learning an efficient constructive sampler for graphs (Q511780) (← links)
- Feynman graph generation and calculations in the Hopf algebra of Feynman graphs (Q525745) (← links)
- A distance measure for large graphs based on prime graphs (Q531270) (← links)
- Computational determination of (3,11) and (4,7) cages (Q553952) (← links)
- Computing isomorphisms of association schemes and its application (Q597120) (← links)
- Solving subgraph isomorphism problems with constraint programming (Q606895) (← links)
- Fundamental domains for congruence subgroups of \(\text{SL}_2\) in positive characteristic. (Q630864) (← links)
- Isomorphism testing via polynomial-time graph extensions (Q662128) (← links)
- Reformulations in mathematical programming: automatic symmetry detection and exploitation (Q662305) (← links)
- Automated generation of conjectures on forbidden subgraph characterization (Q741737) (← links)
- On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers (Q823775) (← links)
- Exploiting symmetries in mathematical programming via orbital independence (Q829174) (← links)
- Computing automorphisms of semigroups. (Q846358) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- Matching graphs with unique node labels (Q851709) (← links)
- Election and rendezvous with incomparable labels (Q930904) (← links)
- On the construction of \(q\)-ary equidistant codes (Q941879) (← links)
- G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs (Q948692) (← links)
- Isomorphism identification of graphs: especially for the graphs of kinematic chains (Q959075) (← links)
- Cop-win graphs with maximum capture-time (Q968433) (← links)
- Graph matching using the interference of continuous-time quantum walks (Q1010111) (← links)
- A parametric filtering algorithm for the graph isomorphism problem (Q1020495) (← links)
- Graph based isomorph-free generation of two-level regular fractional factorial designs (Q1036716) (← links)
- Generating water clusters and other directed graphs (Q1037502) (← links)
- On implementing symmetry detection (Q1037637) (← links)
- Maximal integral point sets in affine planes over finite fields (Q1043989) (← links)
- The 2-rotational Steiner triple systems of order 25 (Q1183971) (← links)
- Permutation group algorithms based on partitions. I: Theory and algorithms (Q1192233) (← links)
- Fractional isomorphism of graphs (Q1336666) (← links)
- Detecting almost symmetries of graphs (Q1621684) (← links)
- A long trip in the charming world of graphs for pattern recognition (Q1677050) (← links)
- Efficient subgraph matching using topological node feature constraints (Q1677053) (← links)
- QUBO formulations for the graph isomorphism problem and related problems (Q1682856) (← links)
- VF2++ -- an improved subgraph isomorphism algorithm (Q1744243) (← links)
- Minimal and canonical images (Q1755579) (← links)
- New refiners for permutation group search (Q1757005) (← links)
