Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs

Authors:
Mrinmoy Hota;Madhumangal Pal;Tapan K. Pal
Affiliations:
Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore-721 102, India;Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore-721 102, India. madhumangal@lycos.com;Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore-721 102, India
Venue:
Computational Optimization and Applications
Year:
2004

Citing 10
Cited 1

Efficient parallel algorithms for a class of graph theoretic problems

SIAM Journal on Computing
Trapezoid graphs and their coloring

Discrete Applied Mathematics
On the 2-chain subgraph cover and related problems

Journal of Algorithms
Dominations in trapezoid graphs

Information Processing Letters
Steiner set and connected domination in trapezoid graphs

Information Processing Letters
On the structure of trapezoid graphs

Discrete Applied Mathematics
A parallel algorithm for solving the coloring problem on trapezoid graphs

Information Processing Letters
A linear time algorithm for finding depth-first spanning trees on trapezoid graphs

Information Processing Letters
An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs

Computational Optimization and Applications
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

Counting the number of vertex covers in a trapezoid graph

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a sequential algorithm is presented to find all cut-vertices on trapezoid graphs. To every trapezoid graph G there is a corresponding trapezoid representation. If all the 4n corner points of n trapezoids, in a trapezoid representation of a trapezoid graph G with n vertices, are given, then the proposed sequential algorithm runs in O(n) time. Parallel implementation of this algorithm can be done in O(log n) time using O(n/ log n) processors on an EREW PRAM model.