Open access
Sep 2026
Finding influential nodes via isolated local average shortest path with an extended neighborhood
Experimental findings show that LAISC surpasses traditional centrality measures in effectively spreading information across complex networks, and incorporates the extended neighborhood concept for finding the nearest neighbor nodes for all nodes in a graph.
ReddyPriya Madupuri, M. Enduri, Satish Anamalamudi et al.
· Discover Computing · 0 citations