Conflict Analysis and Branching Heuristics in the Search for Graph Automorphisms

We adapt techniques from the constraint programming and satisfiability literatures to expedite the search for graph automorphisms. Specifically, we implement conflict-driven backjumping, several branching heuristics, andrestarts. To support backjumping, we extend high-performance search for graph au...

Full description

Saved in:
Bibliographic Details
Published in2013 IEEE 25th International Conference on Tools with Artificial Intelligence pp. 907 - 914
Main Authors Codenotti, Paolo, Katebi, Hadi, Sakallah, Karem A., Markov, Igor L.
Format Conference Proceeding Journal Article
LanguageEnglish
Published IEEE 01.01.2013
Subjects
Algorithm design and analysis
Artificial intelligence
Automorphisms
Benchmark testing
Conferences
Empirical analysis
Expert systems
Generators
Graphs
Heuristic
Labeling
Orbits
Partitioning algorithms
Programming
Searching
Software algorithms
Online AccessGet full text

Cover

More Information
Summary:We adapt techniques from the constraint programming and satisfiability literatures to expedite the search for graph automorphisms. Specifically, we implement conflict-driven backjumping, several branching heuristics, andrestarts. To support backjumping, we extend high-performance search for graph automorphisms with a novel framework for conflict analysis. Empirically, these techniques improve performance up to several orders of magnitude.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Conference-1
ObjectType-Feature-3
content type line 23
SourceType-Conference Papers & Proceedings-2
ISSN:1082-3409
DOI:10.1109/ICTAI.2013.139