Conflict propagation and component recursion for canonical labeling

Authors:
Tommi Junttila;Petteri Kaski
Affiliations:
Aalto University and Helsinki Institute for Information Technology, Department of Information and Computer Science, Aalto, Finland;Aalto University and Helsinki Institute for Information Technology, Department of Information and Computer Science, Aalto, Finland
Venue:
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Year:
2011

Citing 3
Cited 2

Canonical labeling of graphs

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Faster symmetry discovery using sparsity of symmetries

Proceedings of the 45th annual Design Automation Conference
Isomorhism of Hypergraphs of Low Rank in Moderately Exponential Time

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science

Conflict anticipation in the search for graph automorphisms

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Practical graph isomorphism, II

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The individualize and refine approach for computing automorphism groups and canonical forms of graphs is studied. Two new search space pruning techniques, conflict propagation based on recorded failure information and recursion over nonuniformly joined components, are presented. Experimental results show that the techniques can result in substantial decrease in both search space sizes and run times.