An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs

George B. Mertzios, Walter Unger. An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs. In Mirka Miller, Koichi Wada, editors, Proceedings of the 19th International Workshop on Combinatorial Algorithms, IWOCA 2008, September 13-15, 2008, Nagoya, Japan. pages 197-211, College Publications, 2008.

Abstract

Abstract is missing.