46 citations · 98 across the 13 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.SI2017★ 1 cited
Spectral Algorithms for Temporal Graph Cuts
Arlei Silva, Ambuj Singh, Ananthram Swami
The sparsest cut problem consists of identifying a small set of edges that breaks the graph into balanced sets of vertices. The normalized cut problem balances the total degree, in…
cs.SI2017★ 1 cited
Maximizing Coverage Centrality via Network Design: Extended Version
Sourav Medya, Arlei Silva, Ambuj Singh +2
Network centrality plays an important role in many applications. Central nodes in social networks can be influential, driving opinions and spreading news or rumors.In hyperlinked e…