首页    期刊浏览 2024年11月08日 星期五
登录注册

文章基本信息

  • 标题:A Parallel Algorithm for the Spanning Forest Problem on Proper Circle Graphs
  • 本地全文:下载
  • 作者:Hirotoshi Honma ; Yoko Nakajima ; Atsushi Sasaki
  • 期刊名称:Journal of Computer and Communications
  • 印刷版ISSN:2327-5219
  • 电子版ISSN:2327-5227
  • 出版年度:2017
  • 卷号:05
  • 期号:14
  • 页码:48-55
  • DOI:10.4236/jcc.2017.514005
  • 语种:English
  • 出版社:Scientific Research Publishing
  • 摘要: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
国家哲学社会科学文献中心版权所有