Sciweavers

Share
DAC
2008
ACM

Faster symmetry discovery using sparsity of symmetries

9 years 3 months ago
Faster symmetry discovery using sparsity of symmetries
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this symmetry. However, existing tools suffer quadratic runtime in the number of symmetries explicitly returned and are of limited use on very large, sparse, symmetric graphs. This paper introduces a new symmetry-discovery algorithm which exploits the sparsity present not only in the input but also the output, i.e., the symmetries themselves. By avoiding quadratic runtime on large graphs, it improves state-ofthe-art runtimes from several days to less than a second. Categories and Subject Descriptors G.2.2 [Discrete Mathematics]: Graph algorithms General Terms Algorithms, Verification. Keywords Symmetry, sparsity, graph automorphism, partition refinement, constraint satisfaction problems, Boolean satisfiability, model checking.
Paul T. Darga, Karem A. Sakallah, Igor L. Markov
Added 12 Nov 2009
Updated 12 Nov 2009
Type Conference
Year 2008
Where DAC
Authors Paul T. Darga, Karem A. Sakallah, Igor L. Markov
Comments (0)
books