Optimal sequential and parallel algorithms for cut vertices and bridges on trapezoid graphs
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 kappa(G-nu) > kappa(G), where kappa(G) is the number of components in G. Similarly, an edge e is a bridge of G if kappa(G- e) > kappa(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.
algorithm bridge trapezoid graph cut vertex