392 citations · 2.2k across the 33 of their papers we have counts for
1 paper · 2 filters
Binh-Minh Bui-Xuan, Nick S. Jones
By considering the task of finding the shortest walk through a network we find an algorithm for which the run time is not as O(2^n), with n being the number of nodes, but instead s…