1 code implementation • 28 May 2014 • Cunlai Pu, Wei Cui
We propose two algorithms, the random augmenting approach (RPA) and the Hamilton-path based approach (HPA), for finding the approximately longest simple path in a network.
Data Analysis, Statistics and Probability
