Faster Algorithms for Mining Shortest-Path Distances from Massive Time-Evolving Graphs
Sign Up to like & getrecommendations! Published in 2020 at "Algorithms"
DOI: 10.3390/a13080191
Abstract: Computing shortest-path distances is a fundamental primitive in the context of graph data mining, since this kind of information is essential in a broad range of prominent applications, which include social network analysis, data routing,… read more here.
Keywords: time evolving; time; path distances; graph ... See more keywords