Characterization of efficiently solvable problems on distance-hereditary graphs

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

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

题名:	Characterization of efficiently solvable problems on distance-hereditary graphs
作者:	Hsieh,SY;Ho,CW;Hsu,TS;Ko,MT;Chen,GH
贡献者:	資訊工程研究所
关键词:	DOMINATION;ALGORITHMS;TREE
日期:	1998
上传时间:	2010-06-29 20:15:23 (UTC+8)
出版者:	中央大學
摘要:	In the literature, there are quite a few sequential and parallel algorithms to solve problems in a distance-hereditary graph G utilizing techniques discovered from the properties of the problems. Based on structural properties of G, we first sketch characteristics of problems which can be systematic solved on G and then define a general problem-solving paradigm. Given a decomposition tree representation of G, we propose a unified approach to construct sequential dynamic-programming algorithms for several fundamental graph-theoretical problems that fit into our paradigm. We also show that our sequential solutions can be efficiently parallelized using the tree contraction technique.
關聯:	ALGORITHMS AND COMPUTATIONS
显示于类别:	[資訊工程研究所] 期刊論文

文件中的档案:

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

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

社群 sharing