203 citations · 288 across the 21 of their papers we have counts for
3 papers · 1 filter
HyperGCN: A New Method of Training Graph Convolutional Networks on Hypergraphs
Naganand Yadati, Madhav Nimishakavi, Prateek Yadav +3
In many real-world network datasets such as co-authorship, co-citation, email communication, etc., relationships are complex and go beyond pairwise. Hypergraphs provide a flexible…
Semi-Random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery
Anand Louis, Rakesh Venkat
The problem of computing the vertex expansion of a graph is an NP-hard problem. The current best worst-case approximation guarantees for computing the vertex expansion of a graph a…
On Euclidean -Means Clustering with -Center Proximity
Amit Deshpande, Anand Louis, Apoorv Vikram Singh
-means clustering is NP-hard in the worst case but previous work has shown efficient algorithms assuming the optimal -means clusters are \emph{stable} under additive or multi…