Computing the All-Pairs Longest Chain in the Plane

Many problems on sequences and on circular-arc graphs involve the computation of longest chains between points in the plane. Given a set S of n points in the plane, we consider the problem of computing the matrix of longest chain lengths between all pairs of points in S, and the matrix of “parent” pointers that describes the n longest chain trees. We present a simple sequential algorithm for computing these matrices. Our algorithm runs in O(n2) time, and hence is optimal. We also present a rather involved parallel algorithm that computes these matrices in O(log2n) time using O(n2/log n) processors in the CREW PRAM model. These matrices enables us to report, in O(1) time, the length of a longest chain between any two points in S by using one processor, and the actual chain by using k processors, where k is the number of points of S on that chain. The space complexity of the algorithms is O(n2).

[1]  Richard P. Brent,et al.  The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.

[2]  Mikhail J. Atallah,et al.  Parallel Rectilinear Shortest Paths with Rectangular Obstacles , 1991, Comput. Geom..

[3]  Joseph Y.-T. Leung,et al.  Efficient algorithms for interval graphs and circular-arc graphs , 1982, Networks.

[4]  Jorge Urrutia,et al.  Finding maximum cliques in circle graphs , 1981, Networks.

[5]  Robert E. Tarjan,et al.  An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..

[6]  David Eppstein,et al.  The expected extremes in a Delaunay triangulation , 1991, Int. J. Comput. Geom. Appl..

[7]  Uzi Vishkin,et al.  Finding Level-Ancestors in Trees , 1994, J. Comput. Syst. Sci..

[8]  Alok Aggarwal,et al.  Notes on searching in multidimensional monotone arrays , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[9]  A. Lempel,et al.  Transitive Orientation of Graphs and Identification of Permutation Graphs , 1971, Canadian Journal of Mathematics.

[10]  Mikhail J. Atallah,et al.  An efficient parallel algorithm for the row minima of a totally monotone matrix , 1991, SODA '91.

[11]  Michael L. Fredman,et al.  On computing the length of longest increasing subsequences , 1975, Discret. Math..

[12]  Fanica Gavril,et al.  Algorithms on circular-arc graphs , 1974, Networks.

[13]  Bernard Chazelle.  OPTIMAL ALGORITHMS FOR COMPUTING DEPTHS AND LAYERS. , 1983 .

[14]  Amir Pnueli,et al.  Permutation Graphs and Transitive Graphs , 1972, JACM.

[15]  Mikhail J. Atallah,et al.  New clique and independent set algorithms for circle graphs , 1992, Discret. Appl. Math..

[16]  Mikhail J. Atallah,et al.  Efficient Parallel Algorithms for String Editing and Related Problems , 1990, SIAM J. Comput..

[17]  Fanica Gavril,et al.  Algorithms for a maximum clique and a maximum independent set of a circle graph , 1973, Networks.

[18]  Wen-Lian Hsu,et al.  Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs , 1985, SIAM J. Comput..