Abstract: Many applications, from logistics to social networks, rely on quickly navigating the shortest pathways inside large-scale graphs. For shortest route finding in huge data settings, this study ...
Abstract: Traditional shortest-path graph kernels generate for each graph a histogram-like feature map, whose elements represent the number of occurrences of non-isomorphic shortest paths in this ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results