论文信息 - An efficient algorithm to solve connectivity problem on trapezoid graphs

An efficient algorithm to solve connectivity problem on trapezoid graphs

The connectivity problem is a fundamental problem in graph theory. The best known algorithm to solve the connectivity problem on general graphs withn vertices andm edges takesO(K(G)mn1.5) time, whereK(G) is the vertex connectivity ofG. In this paper, an efficient algorithm is designed to solve vertex connectivity problem, which takesO(n2) time andO(n) space for a trapezoid graph.

Madhumangal Pal | Prabir K. Ghosh

[1] Sajal K. Das,et al. Efficient Parallel Algorithms on Interval Graphs , 1992, PARLE.

[2] Alan P. Sprague,et al. Optimal Parallel Algorithms for Finding Cut Vertices and Bridges of Interval Graphs , 1992, Inf. Process. Lett..

[3] Robert E. Tarjan,et al. Network Flow and Testing Graph Connectivity , 1975, SIAM J. Comput..

[4] Madhumangal Pal,et al. An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs , 2002, Int. J. Comput. Math..

[5] Ming-Yang Kao,et al. Scan-First Search and Sparse Certificates: An Improved Parallel Algorithms for k-Vertex Connectivity , 1993, SIAM J. Comput..

[6] S. Lakshmivarahan,et al. Efficient parallel algorithms for finding biconnected components of some intersection graphs , 1991, CSC '91.