Conflict propagation and component recursion for canonical labeling

DOI10.1007/978-3-642-19754-3_16MaRDI QIDQ2999342zbMATH OpenOpenAlexFDO

Authors Tommi Junttila, Petteri Kaski

Publication date 12 May 2011

Published in Theory and Practice of Algorithms in (Computer) Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-19754-3_16

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Recommendations

• Novel techniques to speed up the computation of the automorphism group of a graph
• Conflict Anticipation in the Search for Graph Automorphisms
• Engineering an efficient canonical labeling tool for large and sparse graphs
• scientific article; zbMATH DE number 1004935
• The parallel complexity of graph canonization under abelian group action

Cited in

(16)

• Practical graph isomorphism. II.
• Novel techniques to speed up the computation of the automorphism group of a graph
• Bounding the Weisfeiler-Leman dimension via a depth analysis of I/R-trees
• Maximum independent sets and supervised learning
• Detecting and handling reflection symmetries in mixed-integer (nonlinear) programming and beyond
• Satsuma: structure-based symmetry breaking in SAT
• Graph symmetry detection and canonical labeling: differences and synergies
• Bernoulli and binomial proliferation on evolutionary graphs
• Minimal representatives of endofunctions
• Computational complexity of the Weisfeiler-Leman dimension
• Computational complexity of the Weisfeiler-Leman dimension
• Isomorphism test for digraphs with weighted edges
• Benchmark Graphs for Practical Graph Isomorphism
• Towards an isomorphism dichotomy for hereditary graph classes
• Modular rewritable Petri nets: an efficient model for dynamic distributed systems
• Characterization of symmetry of complex networks

Describes a project that uses

Uses Software

• nauty

This page was built for publication: Conflict propagation and component recursion for canonical labeling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999342)