Engineering an efficient canonical labeling tool for large and sparse graphs
From MaRDI portal
Recommendations
Cited in
(53)- An efficient distributed algorithm for canonical labeling on directed split-stars
- Efficient modularity density heuristics for large graphs
- Minimal and canonical images
- There is no (75,32,10,16) strongly regular graph
- Optimal symmetry breaking for graph problems
- Permutation group algorithms based on directed graphs
- Classical symmetries and the quantum approximate optimization algorithm
- Enumerating partial Latin rectangles
- DiscreteZOO: a fingerprint database of discrete objects
- Novel techniques to speed up the computation of the automorphism group of a graph
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
- Tight lower and upper bounds for the complexity of canonical colour refinement
- Practical graph isomorphism. II.
- Conflict propagation and component recursion for canonical labeling
- Non-existence of a ternary constant weight (16,5,15;2048) diameter perfect code
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
- Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips
- Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description)
- Error thresholds for arbitrary Pauli noise
- Graph similarity and approximate isomorphism
- Isomorphism and invariants of parallelisms of projective spaces
- scientific article; zbMATH DE number 7561610 (Why is no real title available?)
- Symmetry-driven network reconstruction through pseudobalanced coloring optimization
- Isomorphism test for digraphs with weighted edges
- Study of graph isomorphism using Jordan forms of adjacency matrices
- A proof system for graph (non)-isomorphism verification
- An adaptive prefix-assignment technique for symmetry reduction
- Computing Autotopism Groups of Partial Latin Rectangles
- Handling symmetries in mixed-integer semidefinite programs
- Fast computation of the centralizer of a permutation group in the symmetric group
- Corners and simpliciality in oriented matroids and partial cubes
- A census of small Schurian association schemes
- Weighted temporal event graphs and temporal-network connectivity
- Graph methods for recognition of CMOS gates in transistor-level circuits
- Software for proper vertex-colouring exploiting graph symmetry
- Computing canonical images in permutation groups with graph backtracking
- The iteration number of colour refinement
- Eigenspace embeddings of imprimitive association schemes
- Graph symmetry detection and canonical labeling: differences and synergies
- Bounding the Weisfeiler-Leman dimension via a depth analysis of I/R-trees
- Minimal generating sets for matrix monoids
- Symmetry detection in mixed-integer conic programming
- Comparative design-choice analysis of color refinement algorithms beyond the worst case
- Search problems in trees with symmetries: near optimal traversal strategies for individualization-refinement algorithms
- Logarithmic Weisfeiler-Leman identifies all planar graphs
- Computational complexity of the Weisfeiler-Leman dimension
- Computational complexity of the Weisfeiler-Leman dimension
- Uniform semi-Latin squares and their pairwise-variance aberrations
- Distributed discovery of frequent subgraphs of a network using MapReduce
- Symmetric blocking
- A computational approach to construct a multivariate complete graph invariant
- Integer sequence discovery from small graphs
- Improved random graph isomorphism
This page was built for publication: Engineering an efficient canonical labeling tool for large and sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233500)
