TITLE:
A Parallel Algorithm for the Spanning Forest Problem on Proper Circle Graphs
AUTHORS:
Hirotoshi Honma, Yoko Nakajima, Atsushi Sasaki
KEYWORDS:
Design and Analysis of Parallel Algorithms, Proper Circle Graphs, Spanning Forest
JOURNAL NAME:
Journal of Computer and Communications,
Vol.5 No.14,
December
26,
2017
ABSTRACT: 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 antime parallel algorithm with processors for constructing a spanning forest on proper circle graph G on EREW PRAM.