Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

AN EFFICIENT ALGORITHM TO SOLVE CONNECTIVITY PROBLEM ON TRAPEZOID GRAPHS

  • Ghosh, Prabir K. (Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University) ;
  • Pal, Madhumangal (Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University)
  • Published : 2007.05.31

⟨ Previous Next ⟩

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)mn^{1.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(n^2)$ time and O(n) space for a trapezoid graph.

Keywords