{"_id":"3a9rmCTerT4mKMrN6","bibbaseid":"barak-chou-lei-schramm-sheng-nearlyefficientalgorithmsforthegraphmatchingproblemoncorrelatedrandomgraphs-2018","author_short":["Barak, B.","Chou, C.","Lei, Z.","Schramm, T.","Sheng, Y."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Boaz"],"propositions":[],"lastnames":["Barak"],"suffixes":[]},{"firstnames":["Chi-Ning"],"propositions":[],"lastnames":["Chou"],"suffixes":[]},{"firstnames":["Zhixian"],"propositions":[],"lastnames":["Lei"],"suffixes":[]},{"firstnames":["Tselil"],"propositions":[],"lastnames":["Schramm"],"suffixes":[]},{"firstnames":["Yueqi"],"propositions":[],"lastnames":["Sheng"],"suffixes":[]}],"title":"(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs","journal":"CoRR","volume":"abs/1805.02349","year":"2018","url":"http://arxiv.org/abs/1805.02349","eprinttype":"arXiv","eprint":"1805.02349","timestamp":"Mon, 13 Aug 2018 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/corr/abs-1805-02349.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/corr/abs-1805-02349,\n author = {Boaz Barak and\n Chi{-}Ning Chou and\n Zhixian Lei and\n Tselil Schramm and\n Yueqi Sheng},\n title = {(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated\n Random Graphs},\n journal = {CoRR},\n volume = {abs/1805.02349},\n year = {2018},\n url = {http://arxiv.org/abs/1805.02349},\n eprinttype = {arXiv},\n eprint = {1805.02349},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-1805-02349.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Barak, B.","Chou, C.","Lei, Z.","Schramm, T.","Sheng, Y."],"key":"DBLP:journals/corr/abs-1805-02349","id":"DBLP:journals/corr/abs-1805-02349","bibbaseid":"barak-chou-lei-schramm-sheng-nearlyefficientalgorithmsforthegraphmatchingproblemoncorrelatedrandomgraphs-2018","role":"author","urls":{"Paper":"http://arxiv.org/abs/1805.02349"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://dblp.org/pid/b/BBarak.bib","dataSources":["sNDcqxpX5cBQ5Pu7G","763eChmCTEH5onHpy"],"keywords":[],"search_terms":["nearly","efficient","algorithms","graph","matching","problem","correlated","random","graphs","barak","chou","lei","schramm","sheng"],"title":"(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs","year":2018}