55 citations · 159 across the 17 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.SI2017★ 1 cited
Active Betweenness Cardinality: Algorithms and Applications
Yusuf Ozkaya, A. Erdem Sariyuce, Umit V. Catalyurek +1
Centrality rankings such as degree, closeness, betweenness, Katz, PageRank, etc. are commonly used to identify critical nodes in a graph. These methods are based on two assumptions…
cs.SI2017★ 55 cited
Local Algorithms for Hierarchical Dense Subgraph Discovery
Ahmet Erdem Sariyuce, C. Seshadhri, Ali Pinar
Finding the dense regions of a graph and relations among them is a fundamental problem in network analysis. Core and truss decompositions reveal dense subgraphs with hierarchical r…