Optimal Parallel Algorithms for Finding Cut Vertices and Bridges of Interval Graphs

Abstract We present O(log n ) time algorithm in the EREW PRAM model, using n /log n processors, to find cut vertices, bridges, and blocks (often called biconnected components) of an interval graph having n vertices. It is assumed the interval graph is represented by an interval model, with ends presorted. If the ends are not presorted, our algorithms, preceded by an optimal sort, form an O(log n ) time algorithm using n processors, which is shown to be optimal. The algorithms rely heavily on the parallel prefix algorithm.

[1]  Takeshi Yoshimura,et al.  Efficient Algorithms for Channel Routing , 1982, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

[3]  Alan A. Bertossi,et al.  Some parallel algorithms on interval graphs , 1987, Discret. Appl. Math..

[4]  Bela Bollobas,et al.  Graph theory , 1979 .

[5]  Larry Rudolph,et al.  The power of parallel prefix , 1985, IEEE Transactions on Computers.

[6]  Sartaj Sahni,et al.  Binary Trees and Parallel Scheduling Algorithms , 1981, IEEE Transactions on Computers.

[7]  Yung H. Tsin,et al.  Efficient Parallel Algorithms for a Class of Graph Theoretic Problems , 1984, SIAM J. Comput..

[8]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[9]  Stephan Olariu,et al.  Optimal Parallel Algorithms for Problems Modeled by a Family of Intervals , 1992, IEEE Trans. Parallel Distributed Syst..

[10]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

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

[12]  Michael Ben-Or,et al.  Lower bounds for algebraic computation trees , 1983, STOC.

[13]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[14]  Frank Harary,et al.  Graph Theory , 2016 .