scientific article; zbMATH DE number 3823850

zbMATH Open0521.05061MaRDI QIDQ3671211FDOQ3671211

Publication date: 1981

Title of this publication is not available (Why is that?)

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)

Cited In (only showing first 100 items - show all)

Polynomial algorithms for open plane graph and subgraph isomorphisms
Counting proper colourings in 4-regular graphs via the Potts model
On the binary projective codes with dimension 6
On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers
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.
More non-reconstructible hypergraphs
Graph matching using the interference of continuous-time quantum walks
Short certificates for chromatic equivalence
Gathering robots in graphs: the central role of synchronicity
Improving constrained pattern mining with first-fail-based heuristics
Switching reconstruction of digraphs
A parametric filtering algorithm for the graph isomorphism problem
Graph based isomorph-free generation of two-level regular fractional factorial designs
Chromatic-index-critical graphs of orders 13 and 14
G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
A matching algorithm between precursory 3D process model and 2D working procedure drawing based on subgraph isomorphism
QUBO formulations for the graph isomorphism problem and related problems
Learning an efficient constructive sampler for graphs
Computational determination of (3,11) and (4,7) cages
Formulation symmetries in circle packing
Classification of 9-dimensional trilinear alternating forms over \(\mathrm{GF}(2)\)
Symmetry in complex networks
Matching graphs with unique node labels
Orbital shrinking: theory and applications
Orbital independence in symmetric mathematical programs
A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges
Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips
Permutation group algorithms based on partitions. I: Theory and algorithms
Switching in one-factorisations of complete graphs
Solving Kirkman's schoolgirl problem in a few seconds
Enumerating partial Latin rectangles
Computing isomorphisms of association schemes and its application
Solving subgraph isomorphism problems with constraint programming
Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays
Copositive programming motivated bounds on the stability and the chromatic numbers
The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\)
Locally constrained graph homomorphisms -- structure, complexity, and applications
Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description)
Automated generation of conjectures on forbidden subgraph characterization
Feynman graph generation and calculations in the Hopf algebra of Feynman graphs
Computing automorphisms of semigroups.
Cop-win graphs with maximum capture-time
Orbitopal fixing
Automorphism groups of the Pancake graphs
Reformulations in mathematical programming: automatic symmetry detection and exploitation
Testing isomorphism of graded algebras
Fundamental domains for congruence subgroups of \(\text{SL}_2\) in positive characteristic.
kLog: a language for logical and relational learning with kernels
Filtering for Subgraph Isomorphism
Information theoretic measures of UHG graphs with low computational complexity
A Polynomial Algorithm for Submap Isomorphism
An adaptive prefix-assignment technique for symmetry reduction
Symmetry in world trade network
Using local similarity measures to efficiently address approximate graph matching
Symmetry in mathematical programming
A polynomial representation and a unique code of a simple undirected graph
On the construction of \(q\)-ary equidistant codes
A long trip in the charming world of graphs for pattern recognition
Isomorphism identification of graphs: especially for the graphs of kinematic chains
State Isomorphism in Model Programs with Abstract Data Structures
Election and rendezvous with incomparable labels
Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)
Minimal and canonical images
Isomorphism testing via polynomial-time graph extensions
Ninth and tenth order virial coefficients for hard spheres in \(D\) dimensions
Detecting almost symmetries of graphs
VF2++ -- an improved subgraph isomorphism algorithm
Large-scale network motif analysis using compression
Computing Autotopism Groups of Partial Latin Rectangles
Classical symmetries and the quantum approximate optimization algorithm
The 2-rotational Steiner triple systems of order 25
Generation of Colourings and Distinguishing Colourings of Graphs
On degree-3 and \((n - 4)\)-correlation-immune perfect colorings of \(n\)-cubes
Structural position vectors and symmetries in complex networks
On the evaluation at \(( - \iota ,\iota )\) of the Tutte polynomial of a binary matroid
Novel techniques to speed up the computation of the automorphism group of a graph
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs
Title not available (Why is that?)
Tight lower and upper bounds for the complexity of canonical colour refinement
Graph methods for recognition of CMOS gates in transistor-level circuits
Maximum independent sets and supervised learning
On implementing symmetry detection
On solving a hard quadratic 3-dimensional assignment problem
Enumeration and 3D representation of the stereo-isomers of alkane molecules
No easy puzzles: hardness results for jigsaw puzzles
Scalable semisupervised functional neurocartography reveals canonical neurons in behavioral networks
Symmetry breaking constraints for the minimum deficiency problem
Maximizing algebraic connectivity for certain families of graphs
Study of graph isomorphism using Jordan forms of adjacency matrices
Speeding-up structured probabilistic inference using pattern mining
Refining invariants for computing autotopism groups of partial Latin rectangles
G-Tries: a data structure for storing and finding subgraphs
New refiners for permutation group search
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
Efficient Suboptimal Graph Isomorphism
Graphs isomorphisms under edge-replacements and the family of amoebas
Some further development on the eigensystem approach for graph isomorphism detection

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)