An Optimal Parallel Algorithm for Constructing a Spanning Tree on Circular Permutation Graphs

  • HONMA Hirotoshi
    Department of Information Engineering, Kushiro National College of Technology
  • HONMA Saki
    Electronic Information System Engineering Course, Kushiro National College of Technology
  • MASUYAMA Shigeru
    Department of Knowledge-Based Information Engineering, Toyohashi University of Technology

この論文をさがす

抄録

The spanning tree problem is to find a tree that connects all the vertices of G. This problem has many applications, such as electric power systems, computer network design and circuit analysis. Klein and Stein demonstrated that a spanning tree can be found in O(log n) time with O(n + m) processors on the CRCW PRAM. In general, it is known that more efficient parallel algorithms can be developed by restricting classes of graphs. Circular permutation graphs properly contain the set of permutation graphs as a subclass and are first introduced by Rotem and Urrutia. They provided O(n2.376) time recognition algorithm. Circular permutation graphs and their models find several applications in VLSI layout. In this paper, we propose an optimal parallel algorithm for constructing a spanning tree on circular permutation graphs. It runs in O(log n) time with O(n/ log n) processors on the EREW PRAM.

収録刊行物

被引用文献 (5)*注記

もっと見る

参考文献 (30)*注記

もっと見る

詳細情報

問題の指摘

ページトップへ