AI RESEARCH
Fast Geometric Embedding for Node Influence Maximization
arXiv CS.LG
•
ArXi:2506.07435v3 Announce Type: replace-cross Computing classical centrality measures such as betweenness and closeness is computationally expensive on large-scale graphs. In this work, we