14 citations · 20 across the 3 of their papers we have counts for
3 papers
cs.SI2017★ 6 cited
Degree Ranking Using Local Information
Akrati Saxena, Ralucca Gera, S. R. S. Iyengar
Most real world dynamic networks are evolved very fast with time. It is not feasible to collect the entire network at any given time to study its characteristics. This creates the…
cs.SI2017★ 14 cited
A Faster Method to Estimate Closeness Centrality Ranking
Akrati Saxena, Ralucca Gera, S. R. S. Iyengar
Closeness centrality is one way of measuring how central a node is in the given network. The closeness centrality measure assigns a centrality value to each node based on its acces…
math.CO2015
A Graph Theoretical Analysis of the Number of Edges in k-dense Graphs
Linda Eroh, Henry Escuardo, Ralucca Gera +2
Due to the increasing discovery and implementation of networks within all disciplines of life, the study of subgraph connectivity has become increasingly important. Motivated by th…