• Title/Summary/Keyword: trapezoid graphs

Search Result 2, Processing Time 0.016 seconds

AN EFFICIENT ALGORITHM TO SOLVE CONNECTIVITY PROBLEM ON TRAPEZOID GRAPHS

  • Ghosh, Prabir K.;Pal, Madhumangal
    • Journal of applied mathematics & informatics
    • /
    • v.24 no.1_2
    • /
    • pp.141-154
    • /
    • 2007
  • 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.

AN OPTIMAL PRAM ALGORITHM FOR A SPANNING TREE ON TRAPEZOID GRAPHS

  • Bera, Debashis;Pal, Madhumangal;Pal, Tapan K.
    • Journal of applied mathematics & informatics
    • /
    • v.12 no.1_2
    • /
    • pp.21-29
    • /
    • 2003
  • Let G be a graph with n vertices and n edges. The problem of constructing a spanning tree is to find a connected subgraph of G with n vertices and n -1 edges. In this paper, we propose an O(log n) time parallel algorithm with O(n/ log n) processors on an EREW PRAM for constructing a spanning tree on trapezoid graphs.