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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Junttila, T., & Kaski, P. (2011). Conflict propagation and component recursion for canonical labeling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6595 LNCS, pp. 151–162). https://doi.org/10.1007/978-3-642-19754-3_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
