e0640c93b05097a9380870aa06aa0df4-AuthorFeedback.pdf

Indeed interesting6 to vary optimizer. To sketch a 20-node graph down to 5, currently each iteration takes 3.7 .05 Edit distance givesthesame costtodelete anarbitrary edge, while11 COPT distance is higher if the edges deleted were important to the graph spectrum (i.e. Indeed Batson-Spielman-Srivastavaand related works from TCS are fascinating.16 Attemptsto26 classify the sparsifier could see this structure instead of properties of the original graph.