scientific article; zbMATH DE number 3823850
From MaRDI portal
Publication:3671211
Cited in
(only showing first 100 items - show all)- Graph matching using the interference of continuous-time quantum walks
- A parametric filtering algorithm for the graph isomorphism problem
- Graph based isomorph-free generation of two-level regular fractional factorial designs
- Generating water clusters and other directed graphs
- On implementing symmetry detection
- Maximal integral point sets in affine planes over finite fields
- The 2-rotational Steiner triple systems of order 25
- Permutation group algorithms based on partitions. I: Theory and algorithms
- Fractional isomorphism of graphs
- Detecting almost symmetries of graphs
- A long trip in the charming world of graphs for pattern recognition
- Efficient subgraph matching using topological node feature constraints
- QUBO formulations for the graph isomorphism problem and related problems
- VF2++ -- an improved subgraph isomorphism algorithm
- Minimal and canonical images
- New refiners for permutation group search
- Solving Kirkman's schoolgirl problem in a few seconds
- Orbital shrinking: theory and applications
- Counting proper colourings in 4-regular graphs via the Potts model
- Classification of 9-dimensional trilinear alternating forms over \(\mathrm{GF}(2)\)
- On conjectures of network distance measures by using graph spectra
- A new matching algorithm between trees of shapes and its application to brain tumor segmentation
- Kissing numbers of regular graphs
- Classical symmetries and the quantum approximate optimization algorithm
- On computing the path number of a graph
- Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms
- General linear group action on tensors: a candidate for post-quantum cryptography
- Enumerating partial Latin rectangles
- Parallel algorithms for flexible pattern matching on big graphs
- Large-scale network motif analysis using compression
- Gathering robots in graphs: the central role of synchronicity
- Maximizing algebraic connectivity for certain families of graphs
- More non-reconstructible hypergraphs
- Constructions of maximum few-distance sets in Euclidean spaces
- Refining invariants for computing autotopism groups of partial Latin rectangles
- Novel techniques to speed up the computation of the automorphism group of a graph
- Sherali-Adams relaxations of graph isomorphism polytopes
- Simplicial neighbourly 5-polytopes with nine vertices
- No easy puzzles: hardness results for jigsaw puzzles
- Speeding-up structured probabilistic inference using pattern mining
- Information theoretic measures of UHG graphs with low computational complexity
- Tight lower and upper bounds for the complexity of canonical colour refinement
- Filtering graphs to check isomorphism and extracting mapping by using the conductance electrical model
- Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays
- G-Tries: a data structure for storing and finding subgraphs
- Practical graph isomorphism. II.
- On the evaluation at ( - , ) of the Tutte polynomial of a binary matroid
- Enumeration and 3D representation of the stereo-isomers of alkane molecules
- Ninth and tenth order virial coefficients for hard spheres in D dimensions
- On the binary projective codes with dimension 6
- On solving a hard quadratic 3-dimensional assignment problem
- Chromatic-index-critical graphs of orders 13 and 14
- Some further development on the eigensystem approach for graph isomorphism detection
- Generating irreducible copositive matrices using the stable set problem
- Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)
- On the seven non-isomorphic solutions of the fifteen schoolgirl problem
- Formulation symmetries in circle packing
- Symmetry in mathematical programming
- Symmetry breaking constraints for the minimum deficiency problem
- A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges
- Hamiltonian maker-breaker games on small graphs
- Delays induced cluster synchronization in chaotic networks
- Graph fibrations, graph isomorphism, and PageRank
- Generation of Colourings and Distinguishing Colourings of Graphs
- Orbital independence in symmetric mathematical programs
- Local Symmetry Breaking During Search in CSPs
- Filtering for Subgraph Isomorphism
- State Isomorphism in Model Programs with Abstract Data Structures
- A polynomial representation and a unique code of a simple undirected graph
- A Polynomial Algorithm for Submap Isomorphism
- Efficient Suboptimal Graph Isomorphism
- Polynomial algorithms for open plane graph and subgraph isomorphisms
- The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\)
- Switching in one-factorisations of complete graphs
- Orbitopal fixing
- Improving constrained pattern mining with first-fail-based heuristics
- Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips
- A matching algorithm between precursory 3D process model and 2D working procedure drawing based on subgraph isomorphism
- Automorphism groups of the Pancake graphs
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description)
- kLog: a language for logical and relational learning with kernels
- Symmetry in world trade network
- Using local similarity measures to efficiently address approximate graph matching
- Graph similarity and approximate isomorphism
- The power of the Weisfeiler-Leman algorithm to decompose graphs
- scientific article; zbMATH DE number 7622441 (Why is no real title available?)
- scientific article; zbMATH DE number 7561610 (Why is no real title available?)
- The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs
- Invariant synchrony subspaces of sets of matrices
- Learning an efficient constructive sampler for graphs
- Isomorphism test for digraphs with weighted edges
- Study of graph isomorphism using Jordan forms of adjacency matrices
- Automorphism groups of Walecki tournaments with zero and odd signatures
- Testing isomorphism of graded algebras
- Feynman graph generation and calculations in the Hopf algebra of Feynman graphs
- A distance measure for large graphs based on prime graphs
- Short certificates for chromatic equivalence
- Quadratic points on modular curves
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3671211)
