ARC Colloquium: Tselil Schramm (Harvard/MIT)

Algorithms & Randomness Center (ARC)

Tselil Schramm

Monday, September 24, 2018

MiRC Pettit 102 A&B  – 11:00 am


Title:  (Nearly) Efficient Algorithms for the Graph Matching Problem in Correlated Random Graphs

Abstract:  The Graph Matching problem is a robust version of the Graph Isomorphism problem: given two not-necessarily-isomorphic graphs, the goal is to find a permutation of the vertices which maximizes the number of common edges. We study a popular average-case variant; we deviate from the common heuristic strategy and give the first quasi-polynomial time algorithm, where previously only sub-exponential time algorithms were known. 

Based on joint work with Boaz Barak, Chi-Ning Chou, Zhixian Lei, and Yueqi Sheng.


Speaker's Webpage

Videos of recent talks are available at:

Click here to subscribe to the seminar email list:

Event Details


  • Monday, September 24, 2018
    11:00 am - 12:00 pm
Location: MiRC Pettit 102 A&B