Revision as of 10:39, 24 April 2016 by Lbaeza (Talk | contribs)

Group A: The Graph Isomorphism Problem

The Graph Isomorphism Problem

Introduction

The graph isomorphism problem has been a long-standing problem in complexity theory for the last four decades. The statement of the problem is fairly simple: Given any two finite graphs, say $G$

Basic concepts

Importance

Recent developments

Closing Remarks

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood