|School:||Massachusetts Institute of Technology|
|Email:||tonyekim [@] dimax.rutgers.edu|
|Research Area(s):||Semidefinite Programming, Computer Science|
|Project Name:||Finding Isomorphic Substructures, and Its Applications to Analyzing Interaction Graphs (Project #: DDD2008-24 in this list )|
|Faculty Advisor:||Alantha Newman, DIMACS|
Here is the project description from the list of projects website:
Project SummaryWe applied semidefinite programming methods on the graph isomorphism problem and studied how it can be used efficiently. There were two parts to the project; for the first part of the project we studied false positives given by our original semidefinite program for the graph isomorphim problem and for the second part we experiemented with various methods, for example alternative semidefinite programs, to make isomorphism testing fast. The graph isomorphism problem still remains to be solved and we hoped to learn more about the problem by applying semidefinite programming methods. We made some progress on the first part and did experiements with several heuristics for the second part.
For a quick overview of the project, the powerpoint used for my final presentation will be provided upon request.