Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
Given a set of n points (nodes) on a line and a set of m weighted intervals defined on the nodes, we consider a particular dynamic programming (DP) problem on these intervals. If the weight function of the DP has convex or concave property, we can solve this DP problem efficiently by using matrix searching in Monge matrices, together with a new query data structure, which we call the consecutive query structure. We invoke our algorithm to obtain fast algorithms for sequential partition of a graph and for maximum K-clique of an interval graph. © 1998 Elsevier Science B.V. All rights reserved.
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
J. LaRue, C. Ting
Proceedings of SPIE 1989
Shu Tezuka
WSC 1991