What algorithms are known for the graph isomorphism problem? Can those algorithms be related to algorithms for other graph theoretical problems (e.g. subgraph problem, counting graph isomorphisms)?
closed as off-topic by Tyson Williams, cody, domotorp, Marzio De Biasi, Mohammad Al-Turkistany Dec 13 '14 at 8:54
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "Your question does not appear to be a research-level question in theoretical computer science. For more information about the scope, please see help center. Your question might be suitable for Computer Science which has a broader scope." – cody, Marzio De Biasi, Mohammad Al-Turkistany