Discrete Mathematics & Theoretical Computer Science (Jan 2004)

Optimal Sequential and Parallel Algorithms for Cut Vertices and Bridges on Trapezoid Graphs

  • Hon-Chan Chen

DOI
https://doi.org/10.46298/dmtcs.314
Journal volume & issue
Vol. Vol. 6 no. 2

Abstract

Read online

Let G be a graph. A component of G is a maximal connected subgraph in G. A vertex v is a cut vertex of G if k(G-v) > k(G), where k(G) is the number of components in G. Similarly, an edge e is a bridge of G if k(G-e) > k(G). In this paper, we will propose new O(n) algorithms for finding cut vertices and bridges of a trapezoid graph, assuming the trapezoid diagram is given. Our algorithms can be easily parallelized on the EREW PRAM computational model so that cut vertices and bridges can be found in O(log n) time by using O(n / log n) processors.

Keywords