Showing 2022Show all
2 papers · 1 filter
cs.DS2022
Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes
Anand Louis, Rameesh Paul, Arka Ray
There are a lot of recent works on generalizing the spectral theory of graphs and graph partitioning to hypergraphs. There have been two broad directions toward this goal. One gene…
cs.DS2022
Exact recovery algorithm for Planted Bipartite Graph in Semi-random Graphs
Akash Kumar, Anand Louis, Rameesh Paul
The problem of finding the largest induced balanced bipartite subgraph in a given graph is NP-hard. This problem is closely related to the problem of finding the smallest Odd Cycle…