Finding Top-k Important Edges on Bipartite Graphs: Ego-betweenness Centrality-based Approaches.
ICDE（2023）
Key words
bipartite graph,ego-betweenness,top-k search,parallel techniques
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined