scientific article

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

canonical graph label generators of automorphism group

Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph theory (05C99)

Related Items

On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness ⋮ Computing Autotopism Groups of Partial Latin Rectangles ⋮ Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description) ⋮ Invariant Synchrony Subspaces of Sets of Matrices ⋮ Graphs isomorphisms under edge-replacements and the family of amoebas ⋮ Maximum independent sets and supervised learning ⋮ Filtering for Subgraph Isomorphism ⋮ Short certificates for chromatic equivalence ⋮ Quadratic points on modular curves ⋮ Scalable Semisupervised Functional Neurocartography Reveals Canonical Neurons in Behavioral Networks ⋮ Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis ⋮ Symmetry in complex networks ⋮ Graph Similarity and Approximate Isomorphism ⋮ STUDY OF GRAPH ISOMORPHISM USING JORDAN FORMS OF ADJACENCY MATRICES ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Automorphism groups of Walecki tournaments with zero and odd signatures ⋮ An adaptive prefix-assignment technique for symmetry reduction ⋮ State Isomorphism in Model Programs with Abstract Data Structures ⋮ A Polynomial Algorithm for Submap Isomorphism ⋮ Efficient Suboptimal Graph Isomorphism ⋮ The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs ⋮ A Generic Framework for Engineering Graph Canonization Algorithms ⋮ Switching Reconstruction of Digraphs ⋮ Testing isomorphism of graded algebras ⋮ Isomorphism Test for Digraphs with Weighted Edges. ⋮ The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs ⋮ On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers ⋮ Detecting almost symmetries of graphs ⋮ Exploiting symmetries in mathematical programming via orbital independence ⋮ Fractional isomorphism of graphs ⋮ On computing the path number of a graph ⋮ Symmetry in Mathematical Programming ⋮ A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges ⋮ Generation of Colourings and Distinguishing Colourings of Graphs ⋮ Computing automorphisms of semigroups. ⋮ Copositive programming motivated bounds on the stability and the chromatic numbers ⋮ Information theoretic measures of UHG graphs with low computational complexity ⋮ Matching graphs with unique node labels ⋮ Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs ⋮ Orbital Independence in Symmetric Mathematical Programs ⋮ Tight lower and upper bounds for the complexity of canonical colour refinement ⋮ A polynomial representation and a unique code of a simple undirected graph ⋮ Computing isomorphisms of association schemes and its application ⋮ Practical post-quantum signature schemes from isomorphism problems of trilinear forms ⋮ Generating irreducible copositive matrices using the stable set problem ⋮ General linear group action on tensors: a candidate for post-quantum cryptography ⋮ Solving subgraph isomorphism problems with constraint programming ⋮ A long trip in the charming world of graphs for pattern recognition ⋮ Efficient subgraph matching using topological node feature constraints ⋮ Polynomial algorithms for open plane graph and subgraph isomorphisms ⋮ QUBO formulations for the graph isomorphism problem and related problems ⋮ The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\) ⋮ 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 ⋮ Enumerating partial Latin rectangles ⋮ 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 ⋮ Parallel algorithms for flexible pattern matching on big graphs ⋮ Fundamental domains for congruence subgroups of \(\text{SL}_2\) in positive characteristic. ⋮ Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting) ⋮ G-Tries: a data structure for storing and finding subgraphs ⋮ Symmetry Breaking Constraints for the Minimum Deficiency Problem ⋮ Local Symmetry Breaking During Search in CSPs ⋮ Practical graph isomorphism. II. ⋮ On the seven non-isomorphic solutions of the fifteen schoolgirl problem ⋮ On the evaluation at \(( - \iota ,\iota )\) of the Tutte polynomial of a binary matroid ⋮ Large-scale network motif analysis using compression ⋮ Gathering robots in graphs: the central role of synchronicity ⋮ Locally constrained graph homomorphisms -- structure, complexity, and applications ⋮ kLog: a language for logical and relational learning with kernels ⋮ Symmetry in world trade network ⋮ Election and rendezvous with incomparable labels ⋮ Isomorphism testing via polynomial-time graph extensions ⋮ Reformulations in mathematical programming: automatic symmetry detection and exploitation ⋮ Enumeration and 3D representation of the stereo-isomers of alkane molecules ⋮ The 2-rotational Steiner triple systems of order 25 ⋮ On the construction of \(q\)-ary equidistant codes ⋮ Using local similarity measures to efficiently address approximate graph matching ⋮ VF2++ -- an improved subgraph isomorphism algorithm ⋮ G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs ⋮ Permutation group algorithms based on partitions. I: Theory and algorithms ⋮ Learning an efficient constructive sampler for graphs ⋮ Counting proper colourings in 4-regular graphs via the Potts model ⋮ Classification of 9-dimensional trilinear alternating forms over \(\mathrm{GF}(2)\) ⋮ Isomorphism identification of graphs: especially for the graphs of kinematic chains ⋮ Feynman graph generation and calculations in the Hopf algebra of Feynman graphs ⋮ Minimal and canonical images ⋮ New refiners for permutation group search ⋮ A distance measure for large graphs based on prime graphs ⋮ Cop-win graphs with maximum capture-time ⋮ Maximizing algebraic connectivity for certain families of graphs ⋮ Computational determination of (3,11) and (4,7) cages ⋮ Unnamed Item ⋮ Ninth and tenth order virial coefficients for hard spheres in \(D\) dimensions ⋮ Solving Kirkman's schoolgirl problem in a few seconds ⋮ On the binary projective codes with dimension 6 ⋮ More non-reconstructible hypergraphs ⋮ Orbital shrinking: theory and applications ⋮ Constructions of maximum few-distance sets in Euclidean spaces ⋮ On solving a hard quadratic 3-dimensional assignment problem ⋮ On conjectures of network distance measures by using graph spectra ⋮ Automated generation of conjectures on forbidden subgraph characterization ⋮ Graph matching using the interference of continuous-time quantum walks ⋮ Hamiltonian Maker–Breaker Games on Small Graphs ⋮ Delays induced cluster synchronization in chaotic networks ⋮ Refining invariants for computing autotopism groups of partial Latin rectangles ⋮ A parametric filtering algorithm for the graph isomorphism problem ⋮ A new matching algorithm between trees of shapes and its application to brain tumor segmentation ⋮ 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 ⋮ Chromatic-index-critical graphs of orders 13 and 14 ⋮ Some further development on the eigensystem approach for graph isomorphism detection ⋮ Novel techniques to speed up the computation of the automorphism group of a graph ⋮ Kissing numbers of regular graphs ⋮ Sherali-Adams relaxations of graph isomorphism polytopes ⋮ Graph fibrations, graph isomorphism, and PageRank ⋮ Classical symmetries and the quantum approximate optimization algorithm ⋮ Simplicial neighbourly 5-polytopes with nine vertices ⋮ No easy puzzles: hardness results for jigsaw puzzles ⋮ Speeding-up structured probabilistic inference using pattern mining