Conflict Propagation and Component Recursion for Canonical Labeling
From MaRDI portal
Publication:2999342
DOI10.1007/978-3-642-19754-3_16zbMath1325.05169OpenAlexW1687588989MaRDI QIDQ2999342
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
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Modular rewritable Petri nets: an efficient model for dynamic distributed systems ⋮ Towards an isomorphism dichotomy for hereditary graph classes ⋮ Maximum independent sets and supervised learning ⋮ Practical graph isomorphism. II. ⋮ Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic ⋮ Benchmark Graphs for Practical Graph Isomorphism ⋮ A Generic Framework for Engineering Graph Canonization Algorithms ⋮ Bernoulli and binomial proliferation on evolutionary graphs ⋮ Novel techniques to speed up the computation of the automorphism group of a graph ⋮ Characterization of symmetry of complex networks ⋮ Isomorphism Test for Digraphs with Weighted Edges.
Uses Software
This page was built for publication: Conflict Propagation and Component Recursion for Canonical Labeling
