Abstract: Extensive study has been conducted on the problem of finding the shortest path in a graph, leading to the creation of several approaches. The effectiveness of the following algorithms in ...
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
Feedback