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 ...
Abstract: This research is conducted to design and develop a new algorithm for finding out the classic “Shortest Path” between every pair of vertices using an atypical approach. The approach follows ...
Through a Summer Undergraduate Research Fellowship, Jenny Quan is exploring the mathematical principles behind Rubik's cubes.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback