Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

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

Mertzios, G.B. and Unger, W. (2008) 'An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs.', 19th International Workshop on Combinatorial Algorithms (IWOCA) Nagoya, Japan, 13-15 May 2008.


Item Type:Conference item (Paper)
Additional Information:See http://dro.dur.ac.uk/9051. Mertzios, G.B. and Unger, W. (2010) 'An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs.', Mathematics in computer science., 3 (1). pp. 85-96.
Full text:Full text not available from this repository.
Publisher Web site:http://www.iwoca.org/iwoca2008/default.htm
Date accepted:No date available
Date deposited:No date available
Date of first online publication:2008
Date first made open access:No date available

Save or Share this output

Export:
Export
Look up in GoogleScholar