Finding Top-k Important Edges on Bipartite Graphs: Ego-betweenness Centrality-based Approaches | IEEE Conference Publication | IEEE Xplore