Here is a link to the original paper by Hoffman & Singleton.
Lastly, here is a link to the paper about the problem of minimizing interception time for an
anti-incursion program navigating a linked list of ports. Also known as the cop vs. gambler problem. This paper omits some of the more computational details.
If you'd like a very in-depth version of this same paper, see Chapter 5 of this thesis.