4 citations · 5 across the 4 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DC2011
On the Fault Tolerance and Hamiltonicity of the Optical Transpose Interconnection System of Non-Hamiltonian Base Graphs
Esha Ghosh, Subhas K. Ghosh, C. Pandu Rangan
Hamiltonicity is an important property in parallel and distributed computation. Existence of Hamiltonian cycle allows efficient emulation of distributed algorithms on a network whe…
cs.SI2011★ 1 cited
A Lookahead algorithm to compute Betweenness Centrality
B Vignesh, Siddharth S, Shridhar Ramachandran +2
The Betweenness Centrality index is a very important centrality measure in the analysis of a large number of networks. Despite its significance in a lot of interdisciplinary applic…