NeurIPS 2019
Sun Dec 8th through Sat the 14th, 2019 at Vancouver Convention Center
Paper ID:4930
Title:(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs

The reviewers are all positive about the paper. The authors should seriously consider whether Section 5 in the paper as it currently stands is suitable. There is a view among the reviewers that it does more harm than good. Experiments are not really necessary in a NeurIPS paper, and if the gap between the theory set-up and the experimental set-up is large, it is probably worth removing them altogether. In any case, a proper discussion should be added if the section is retained.