885 citations · 3.5k across the 45 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019
Convex Graph Invariant Relaxations For Graph Edit Distance
Utkan Onur Candogan, Venkat Chandrasekaran
The edit distance between two graphs is a widely used measure of similarity that evaluates the smallest number of vertex and edge deletions/insertions required to transform one gra…
cs.DS2012★ 85 cited
Complexity of Inference in Graphical Models
Venkat Chandrasekaran, Nathan Srebro, Prahladh Harsha
It is well-known that inference in graphical models is hard in the worst case, but tractable for models with bounded treewidth. We ask whether treewidth is the only structural crit…