Seminar by Prof. V Arvind
The Graph Isomorphism Problem
Prof. V Arvind
Institute of Mathematical Sciences
Chennai, India
Date: Tuesday and Wednesday, August 26 and 27, 2003
Time: 5:15 PM
Venue: CS-101
Abstract
Given two finite graphs, how hard is it to test if they are isomorphic? The computational complexity of this problem is not yet fully resolved. The aim of this talk is to first give an overview of the known results and then explain some recent results in detail, emphasizing the group-theoretic aspects of the problem.