scientific article; zbMATH DE number 3823850
From MaRDI portal
Publication:3671211
Cited in
(only showing first 100 items - show all)- Polynomial algorithms for open plane graph and subgraph isomorphisms
- On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers
- Large-scale network motif analysis using compression
- Counting proper colourings in 4-regular graphs via the Potts model
- On the binary projective codes with dimension 6
- Computing Autotopism Groups of Partial Latin Rectangles
- Classical symmetries and the quantum approximate optimization algorithm
- The 2-rotational Steiner triple systems of order 25
- Fractional isomorphism of graphs
- A distance measure for large graphs based on prime graphs
- Exploiting symmetries in mathematical programming via orbital independence
- Practical graph isomorphism. II.
- Graph matching using the interference of continuous-time quantum walks
- More non-reconstructible hypergraphs
- Generation of Colourings and Distinguishing Colourings of Graphs
- On the evaluation at \(( - \iota ,\iota )\) of the Tutte polynomial of a binary matroid
- Improving constrained pattern mining with first-fail-based heuristics
- Novel techniques to speed up the computation of the automorphism group of a graph
- Gathering robots in graphs: the central role of synchronicity
- On degree-3 and \((n - 4)\)-correlation-immune perfect colorings of \(n\)-cubes
- Structural position vectors and symmetries in complex networks
- The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs
- Short certificates for chromatic equivalence
- Tight lower and upper bounds for the complexity of canonical colour refinement
- scientific article; zbMATH DE number 7561610 (Why is no real title available?)
- A parametric filtering algorithm for the graph isomorphism problem
- Graph based isomorph-free generation of two-level regular fractional factorial designs
- Switching reconstruction of digraphs
- A matching algorithm between precursory 3D process model and 2D working procedure drawing based on subgraph isomorphism
- G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
- Chromatic-index-critical graphs of orders 13 and 14
- Graph methods for recognition of CMOS gates in transistor-level circuits
- On implementing symmetry detection
- QUBO formulations for the graph isomorphism problem and related problems
- Learning an efficient constructive sampler for graphs
- Maximum independent sets and supervised learning
- Computational determination of (3,11) and (4,7) cages
- On solving a hard quadratic 3-dimensional assignment problem
- Formulation symmetries in circle packing
- Enumeration and 3D representation of the stereo-isomers of alkane molecules
- Classification of 9-dimensional trilinear alternating forms over \(\mathrm{GF}(2)\)
- Matching graphs with unique node labels
- No easy puzzles: hardness results for jigsaw puzzles
- Symmetry in complex networks
- Orbital shrinking: theory and applications
- Orbital independence in symmetric mathematical programs
- Symmetry breaking constraints for the minimum deficiency problem
- Scalable semisupervised functional neurocartography reveals canonical neurons in behavioral networks
- A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges
- Maximizing algebraic connectivity for certain families of graphs
- Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips
- Speeding-up structured probabilistic inference using pattern mining
- Study of graph isomorphism using Jordan forms of adjacency matrices
- Permutation group algorithms based on partitions. I: Theory and algorithms
- Refining invariants for computing autotopism groups of partial Latin rectangles
- Switching in one-factorisations of complete graphs
- New refiners for permutation group search
- G-Tries: a data structure for storing and finding subgraphs
- Efficient Suboptimal Graph Isomorphism
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
- Computing isomorphisms of association schemes and its application
- Solving Kirkman's schoolgirl problem in a few seconds
- Enumerating partial Latin rectangles
- Solving subgraph isomorphism problems with constraint programming
- Copositive programming motivated bounds on the stability and the chromatic numbers
- Some further development on the eigensystem approach for graph isomorphism detection
- Graphs isomorphisms under edge-replacements and the family of amoebas
- Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays
- Parallel algorithms for flexible pattern matching on big graphs
- The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\)
- Sherali-Adams relaxations of graph isomorphism polytopes
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- Automated generation of conjectures on forbidden subgraph characterization
- Feynman graph generation and calculations in the Hopf algebra of Feynman graphs
- Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description)
- Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs
- Quadratic points on modular curves
- Computing automorphisms of semigroups.
- The power of the Weisfeiler-Leman algorithm to decompose graphs
- Orbitopal fixing
- On conjectures of network distance measures by using graph spectra
- Automorphism groups of the Pancake graphs
- Cop-win graphs with maximum capture-time
- Simplicial neighbourly 5-polytopes with nine vertices
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Fundamental domains for congruence subgroups of \(\text{SL}_2\) in positive characteristic.
- kLog: a language for logical and relational learning with kernels
- Generating water clusters and other directed graphs
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms
- General linear group action on tensors: a candidate for post-quantum cryptography
- Efficient subgraph matching using topological node feature constraints
- Testing isomorphism of graded algebras
- Automorphism groups of Walecki tournaments with zero and odd signatures
- Hamiltonian maker-breaker games on small graphs
- Maximal integral point sets in affine planes over finite fields
- A new matching algorithm between trees of shapes and its application to brain tumor segmentation
- Generating irreducible copositive matrices using the stable set problem
- Information theoretic measures of UHG graphs with low computational complexity
- Filtering for Subgraph Isomorphism
- Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis
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)
