If you want to make money online : Register now

Applications of Graph Automorphisms

, , No Comments
Problem Detail: 

I've seen the topic of the automorphism group appear in several introductory graph theory books I've looked at. It always feel oddly disjointed and poorly motivated to me.

Is there any practical (or impractical for that matter) applications of knowing the automorphism group of a graph?

Asked By : eepperly16
Answered By : Stella Biderman

Automorphism capture a natural notion of symmetry of graphs. As a result, they can be used to speed up algorithms that would otherwise run slowly by chopping down the search space.

For example, integer programming is usually solved via branch-and-bound. However, if an equation is degenerate this can take far too long to run, because it has to keep checking symmetric parts of the tree. We can use graph automorphisms to compute the orbits of variables in the linear programming problem, and then treat parts with the same orbit as identical. A recent application of such techniques to MILP can be read here.

Best Answer from StackOverflow

Question Source : http://cs.stackexchange.com/questions/65391

3200 people like this

 Download Related Notes/Documents


Post a Comment

Let us know your responses and feedback