A Technique for Exact Computation of Precoloring Extension on Interval Graphs.
Martin R. Ehmsen and Kim S. Larsen.
International Journal of Foundations of Computer Science, 24(1):109-122, 2013.
Inspired by a real-life application, we investigate the computationally hard problem of extending a precoloring of an interval graph to a proper coloring under some bound on the number of available colors. We are interested in quickly determining whether or not such an extension exists on instances occurring in practice in connection with campsite bookings on a campground. A naive exhaustive search does not terminate in reasonable time. We have formulated a new approach which moves the computation time within the usable range on all the data samples available to us.

Link to the publication at the publisher's site - subscription may be required.
Text required by the publisher (if any): The publication is available from WorldSciNet.

open access (152 KB)
The same as the publisher's version, when the publisher permits. Otherwise, the author's last version before the publisher's copyright; this is often exactly the same, but sometimes fonts, page numbers, figure numbers, etc. are different. It may also be a full version. However, it is safe to read this version, and at the same time cite the official version, as long as references to concrete locations, numbered theorems, etc. inside the article are avoided.

other publications
Other publications by the author.