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

researchr

You are not signed in
Sign in
Sign up

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.

This author has not been identified. Look up 'George B. Mertzios' in GoogleThis author has not been identified. Look up 'Walter Unger' in Google

runs on WebDSL