Author(s)

Hirotoshi Honma, Yoko Nakajima, Atsushi Sasaki

National Institute of Technology, Kushiro College, Kushiro, Japan.

Given a simple graph G with n vertices, m edges and k connected components. The spanning forest problem is to find a spanning tree for each connected component of G. This problem has applications to the electrical power demand problem, computer network design, circuit analysis, etc. In this paper, we present an time parallel algorithm with processors for constructing a spanning forest on proper circle graph G on EREW PRAM.

Design and Analysis of Parallel Algorithms, Proper Circle Graphs, Spanning Forest

Honma, H. , Nakajima, Y. and Sasaki, A. (2017) A Parallel Algorithm for the Spanning Forest Problem on Proper Circle Graphs. Journal of Computer and Communications, 5, 48-55. doi: 10.4236/jcc.2017.514005.