121 citations · 121 across the 2 of their papers we have counts for
3 papers
Identifying high betweenness centrality nodes in large social networks
Nicolas Kourtellis, Tharaka Alahakoon, Ramanuja Simha +2
This paper proposes an alternative way to identify nodes with high betweenness centrality. It introduces a new metric, k-path centrality, and a randomized algorithm for estimating…
Hierarchical Unambiguity
Holger Spakowski, Rahul Tripathi
We develop techniques to investigate relativized hierarchical unambiguous computation. We apply our techniques to generalize known constructs involving relativized unambiguity base…
Complexity Results in Graph Reconstruction
Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski +1
We investigate the relative complexity of the graph isomorphism problem (GI) and problems related to the reconstruction of a graph from its vertex-deleted or edge-deleted subgraphs…