|title:||Optimal Sequential and Parallel Algorithms for Cut Vertices and Bridges on Trapezoid Graphs|
|keywords:||cut vertex, bridge, trapezoid graph, algorithm|
|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 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. |
If your browser does not display the abstract correctly (because of the different mathematical symbols) you can look it up in the PostScript or PDF files.
|reference:||Hon-Chan Chen (2004), Optimal Sequential and Parallel Algorithms for Cut Vertices and Bridges on Trapezoid Graphs, Discrete Mathematics and Theoretical Computer Science 6, pp. 483-496|
|bibtex:||For a corresponding BibTeX entry, please consider our BibTeX-file.|
|ps.gz-source:||dm060220.ps.gz (198 K)|
|ps-source:||dm060220.ps (850 K)|
|pdf-source:||dm060220.pdf (148 K)|
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.