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

Thumbnail Image
Files
schramm.mp4 (391.32 MB)
schramm_videostream.html (1.01 KB)
transcription.txt (42.33 KB)
thumbnail.jpg (204.91 KB)
Author(s)
Schramm, Tselil
Advisor(s)
Editor(s)
Associated Organization(s)
Organizational Unit
Organizational Unit
Series
Series
Collections
Scholarly Events
Supplementary to:
Permanent Link
http://hdl.handle.net/1853/60452
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.
Sponsor
Date
2018-09-24
Extent
48:43 minutes
Resource Type
Moving Image
Resource Subtype
Lecture
Rights Statement
Rights URI