A special case of the $n$-vertex traveling-salesman problem that can be solved in $O(n)$ time

James K. Park
Information Processing Letters 40:247–254, 1991

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!