A Parallel Algorithm for the Spanning Forest Problem on Proper Circle Graphs

Hirotoshi Honma, Yoko Nakajima, Atsushi Sasaki
2017 Journal of Computer and Communications  
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 for constructing a spanning forest on proper circle graph G on EREW PRAM.
doi:10.4236/jcc.2017.514005 fatcat:dueob4jbtzd5hcc6jk6gz7sgki