Parallel decomposition of generalized series-parallel graphs

NCU Institutional Repository > 資訊電機學院 > 資訊工程研究所 > 期刊論文 > Item 987654321/29154

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29154

题名:	Parallel decomposition of generalized series-parallel graphs
作者:	Ho,CW;Hsieh,SY;Chen,GH
贡献者:	資訊工程研究所
关键词:	ALGORITHM
日期:	1999
上传时间:	2010-06-29 20:15:00 (UTC+8)
出版者:	中央大學
摘要:	Generalized series-parallel (GSP) graphs belong to the class of decomposable graphs which can be represented by their decomposition trees. Given a decomposition tree of a GSP graph, there are many graph-theoretic problems which can be solved efficiently. An efficient parallel algorithm for constructing a decomposition tree of a given GSP graph is presented. It takes O(log n) time with C(m, n) processors on a CRCW PRAM, where C(m, n) is the number of processors required to find connected components of a graph with m edges and n vertices in logarithmic time. Based on our algorithmic results, we also derive some properties for GSP graphs, which may be of interest in and of themselves.
關聯:	JOURNAL OF INFORMATION SCIENCE AND ENGINEERING
显示于类别:	[資訊工程研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	460	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing