National Changhua University of Education Institutional Repository : Item 987654321/9977
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 6507/11669
造访人次 : 29954688      在线人数 : 572
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 进阶搜寻

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

题名: Single step searching in weighted block graphs
作者: Hsiao, Ju-Yuan;Tang, C. Y.;Chang, R. S.;Lee, R. C. T.
贡献者: 資訊工程系
日期: 1994-11
上传时间: 2012-05-02T09:36:49Z
出版者: Elsevier BV
摘要: In this paper, three types of problems for single step searching weighted graphs are investigated; the summation minimization (S-type, for short), bottleneck minimization (B-type, for short), and hybrid (H-type, for short) weighted single step graph searching problems. All three types are shown to be NP-hard but polynomial solvable for block graphs. The S-type problem is proved to be linearly equivalent to the optimum weight 2-independent set problem. Then we solve the S-type problem on a block graph G in linear time by solving the optimum weight 2-independent set problem on G. To solve the B-type problem, the first phase computes the bottleneck cost and the second phase constructs the searching plan by applying the S-type algorithm using the bottleneck cost derived in the first phase. Finally, an time algorithm for solving the H-type problem on weighted block graphs is proposed.
關聯: Information Sciences, 81(1-2): 1-29
显示于类别:[資訊工程學系] 期刊論文

文件中的档案:

档案 大小格式浏览次数
2050400410002.pdf8KbAdobe PDF496检视/开启


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

 

DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈