Linear time algorithms for finding maximal forward references
Zhixiang Chen, Richard H. Fowler, A.W.-C. Fu · 2004
In this paper, two algorithms are designed for finding maximal forward references from very large Web logs, longest sequences of Web pages visited by a user without revisiting some previously visited page in the sequence, and their performance is comparatively analyzed. It is shown that the two algorithms have linear (hence optimal) time complexity.