An efficient algorithm to solve connectivity problem on trapezoid graphs

Authors:
Prabir K. Ghosh;Madhumangal Pal
Affiliations:
Vidyasagar University, India;Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore, India
Venue:
Journal of Applied Mathematics and Computing
Year:
2007

Citing 4
Cited 2

Optimal parallel algorithms for finding cut vertices and bridges of interval graphs

Information Processing Letters
Scan-first search and sparse certificates: an improved parallel algorithm for k-vertex connectivity

SIAM Journal on Computing
Efficient parallel algorithms for finding biconnected components of some intersection graphs

CSC '91 Proceedings of the 19th annual conference on Computer Science
Efficient Parallel Algorithms on Interval Graphs

PARLE '92 Proceedings of the 4th International PARLE Conference on Parallel Architectures and Languages Europe

Efficient algorithm for the vertex connectivity of trapezoid graphs

Information Processing Letters
Max-min weight balanced connected partition

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The connectivity problem is a fundamental problem in graph theory. The best known algorithm to solve the connectivity problem on general graphs with n vertices and m edges takes O(K(G)mn1.5) time, where K(G) is the vertex connectivity of G. In this paper, an efficient algorithm is designed to solve vertex connectivity problem, which takes O(n2) time and O(n) space for a trapezoid graph.