Optimal Sequential and Parallel Algorithms for Cut Vertices and Bridges on Trapezoid GraphsReport as inadecuate




Optimal Sequential and Parallel Algorithms for Cut Vertices and Bridges on Trapezoid Graphs - Download this document for free, or read online. Document in PDF available to download.

1 Department of Information Management Taichung

Abstract : 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 kG-v > kG, where kG is the number of components in G. Similarly, an edge e is a bridge of G if kG-e > kG. In this paper, we will propose new On 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 Olog n time by using On - log n processors.

Keywords : cut vertex bridge trapezoid graph algorithm





Author: Hon-Chan Chen -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents