Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
From MaRDI portal
Publication:5233500
DOI10.1137/1.9781611972870.13zbMath1428.68222OpenAlexW165726963MaRDI QIDQ5233500
Publication date: 11 September 2019
Published in: 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611972870.13
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05)
Related Items
Combining SAT solvers with computer algebra systems to verify combinatorial conjectures ⋮ Isomorphism and Invariants of Parallelisms of Projective Spaces ⋮ Uniform semi-Latin squares and their pairwise-variance aberrations ⋮ Non-existence of a ternary constant weight \((16,5,15;2048)\) diameter perfect code ⋮ Tight lower and upper bounds for the complexity of canonical colour refinement ⋮ An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants ⋮ Distributed discovery of frequent subgraphs of a network using MapReduce ⋮ Symmetry-driven network reconstruction through pseudobalanced coloring optimization ⋮ Computing Autotopism Groups of Partial Latin Rectangles ⋮ Handling symmetries in mixed-integer semidefinite programs ⋮ Enumerating partial Latin rectangles ⋮ Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description) ⋮ Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips ⋮ Symmetric blocking ⋮ Fast computation of the centralizer of a permutation group in the symmetric group ⋮ Corners and simpliciality in oriented matroids and partial cubes ⋮ A computational approach to construct a multivariate complete graph invariant ⋮ A census of small Schurian association schemes ⋮ Integer sequence discovery from small graphs ⋮ Practical graph isomorphism. II. ⋮ DiscreteZOO: a fingerprint database of discrete objects ⋮ Graph Similarity and Approximate Isomorphism ⋮ STUDY OF GRAPH ISOMORPHISM USING JORDAN FORMS OF ADJACENCY MATRICES ⋮ Efficient modularity density heuristics for large graphs ⋮ Minimal and canonical images ⋮ Optimal symmetry breaking for graph problems ⋮ Unnamed Item ⋮ An adaptive prefix-assignment technique for symmetry reduction ⋮ There is no (75,32,10,16) strongly regular graph ⋮ Error Thresholds for Arbitrary Pauli Noise ⋮ Permutation group algorithms based on directed graphs ⋮ A Generic Framework for Engineering Graph Canonization Algorithms ⋮ Novel techniques to speed up the computation of the automorphism group of a graph ⋮ Classical symmetries and the quantum approximate optimization algorithm ⋮ Isomorphism Test for Digraphs with Weighted Edges.
Uses Software
