Conflict propagation and component recursion for canonical labeling
DOI10.1007/978-3-642-19754-3_16zbMATH Open1325.05169OpenAlexW1687588989MaRDI QIDQ2999342FDOQ2999342
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
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
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)
Cited In (12)
- Practical graph isomorphism. II.
- Novel techniques to speed up the computation of the automorphism group of a graph
- Maximum independent sets and supervised learning
- Isomorphism Test for Digraphs with Weighted Edges.
- Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic
- A Generic Framework for Engineering Graph Canonization Algorithms
- Bernoulli and binomial proliferation on evolutionary graphs
- Minimal representatives of endofunctions
- 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
Uses Software
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)
