Conflict anticipation in the search for graph automorphisms

Authors:
Hadi Katebi;Karem A. Sakallah;Igor L. Markov
Affiliations:
EECS Department, University of Michigan;EECS Department, University of Michigan;EECS Department, University of Michigan
Venue:
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2012

Citing 8
Cited 3

Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW

Proceedings of the 38th annual Design Automation Conference
Solving difficult SAT instances in the presence of symmetry

Proceedings of the 39th annual Design Automation Conference
Shatter: efficient symmetry-breaking for boolean satisfiability

Proceedings of the 40th annual Design Automation Conference
Exploiting structure in symmetry detection for CNF

Proceedings of the 41st annual Design Automation Conference
Mapping and visualizing the internet

ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference
Faster symmetry discovery using sparsity of symmetries

Proceedings of the 45th annual Design Automation Conference
Conflict propagation and component recursion for canonical labeling

TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Symmetry and satisfiability: an update

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing

A semi-canonical form for sequential AIGs

Proceedings of the Conference on Design, Automation and Test in Europe
A SAT approach to clique-width

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Generalized Boolean symmetries through nested partition refinement

Proceedings of the International Conference on Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

Effective search for graph automorphisms allows identifying symmetries in many discrete structures, ranging from chemical molecules to microprocessor circuits. Using this type of structure can enhance visualization as well as speed up computational optimization and verification. Competitive algorithms for the graph automorphism problem are based on efficient partition refinement augmented with group-theoretic pruning techniques. In this paper, we improve prior algorithms for the graph automorphism problem by introducing simultaneous refinement of multiple partitions, which enables the anticipation of future conflicts in search and leads to significant pruning, reducing overall runtimes. Empirically, we observe an exponential speedup for the family of Miyazaki graphs, which have been shown to impede leading graph-automorphism algorithms.