An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs

  • Yue-Li W
  • Hon-Chan C
  • Chen-Yu L
  • 5

    Readers

    Mendeley users who have this article in their library.
  • 6

    Citations

    Citations of this article.

Abstract

Let G = (V, E) be a graph with n vertices and m edges. The problem of constructing a spanning tree is to find a connected subgraph of G with n vertices and (n - 1) edges. For a weighted graph, the minimum spanning tree problem can be solved G in O(log m) time with O(m) processors on the CRCW PRAM, and for an unweighed graph, the spanning tree problem can be solved in O(log n) time with O(n + m) processors on the CRCW PRAM. In this paper, we shall propose an O(log n) time parallel algorithm with O( n log n) processors on the EREW PRAM for constructing a spanning tree on an unweighted permutation graph. © 1995.

Author-supplied keywords

  • EREW computational model
  • Graph theory
  • Parallel algorithms
  • Permutation graphs
  • Spanning tree

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free