Non UBC
DSpace
Schramm, Tselil
2019-03-27T05:05:21Z
2018-08-13T16:33
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.
https://circle.library.ubc.ca/rest/handle/2429/69307?expand=metadata
31.0
video/mp4
Author affiliation: Harvard/MIT
Oaxaca (Mexico : State)
10.14288/1.0377622
eng
Unreviewed
Vancouver : University of British Columbia Library
Banff International Research Station for Mathematical Innovation and Discovery
Attribution-NonCommercial-NoDerivatives 4.0 International
http://creativecommons.org/licenses/by-nc-nd/4.0/
Postdoctoral
BIRS Workshop Lecture Videos (Oaxaca (Mexico : State))
Mathematics
Computer science
Fourier analysis
Theoretical computer science
(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs
Moving Image
http://hdl.handle.net/2429/69307