Journal of applied mathematics & informatics

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

AN OPTIMAL PRAM ALGORITHM FOR A SPANNING TREE ON TRAPEZOID GRAPHS

  • Bera, Debashis (Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University) ;
  • Pal, Madhumangal (Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University) ;
  • Pal, Tapan K. (Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University)
  • Published : 2003.05.01

⟨ Previous Next ⟩

Abstract

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.

Keywords

References

  1. Ann. Oper. Res. v.13 Algorithms for finding optimum trees: Description, use and evaluation P. M. Camerini;G. Galbiati;F. Maffioli
  2. Prentice Hall of India Private Limited Graph Theroy with Applications to Engineering and computer Science N. Deo
  3. Proc. 25-th An IEEE symp. on FOCS Fibonacci heaps and their uses in network optimization algorithms M. L. Fredman;R. E. Tarjan
  4. Combinatorica v.6 Efficient algorithms for finding minimum spanning trees in undirected and directed graphs H. P. Gabow;Z. Galil;T. Spencerl;R. E. Tarjan
  5. Benjamin / Cummings, Menio Park. CA Graph Therory G R. Gould
  6. Intern. J. Computer Math v.70 An efficient algorithm to generate all maximal independent sets on trapezoid grphs M. Hota;M. Pal;T. K. Pal
  7. Information Processing Letters v.34 A parallel algorithm for eliminating cycles in undirected graphs P. Klein;C. Stein
  8. IEEE Trans. Computer. v.34 The power of parallel prefix C. P. Kruskal;L. Rudolph;M. Snir
  9. Proc. Amer. Math. Soc. v.7 On the shortest spanning subtree of a graph and the travelling salesman problem J. B. kruskal
  10. Bell Systems Tech. J. v.36 Shortest connection networks and some generalizations R. C. Prim
  11. Information Processing Letters v.45 An O(logm) parallel algorithm for the minimum spanning tree problem F. Suraweera;P. Bhattacharya
  12. SIAM Data Structures and network Algorithms R. E. Tarjan
  13. Information Processing Letters v.53 An O(logn) parallel algorithm for constructing a spanning tree on permutation graph Y. L. Wang;H. C. Chen;C. Y. Lee
  14. Information Processing Letters v.4 An O(/E/ log log /V/) algorithm for finding minimum spanning tree A. Yao