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