Conflict Anticipation in the Search for Graph Automorphisms

DOI10.1007/978-3-642-28717-6_20zbMath1352.68223arXiv1208.6269OpenAlexW1864537025MaRDI QIDQ2891455

Hadi Katebi, Igor L. Markov, Karem A. Sakallah

Publication date: 15 June 2012

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.6269

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Breaking symmetries in graph search with canonizing sets ⋮ A SAT Approach to Clique-Width ⋮ Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks ⋮ Novel techniques to speed up the computation of the automorphism group of a graph

Uses Software

• nauty
• Velev SAT Benchmarks

This page was built for publication: Conflict Anticipation in the Search for Graph Automorphisms