National Changhua University of Education Institutional Repository : Item 987654321/9988
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 6498/11670
造访人次 : 25679233      在线人数 : 66
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/9988

题名: Solving the single step graph searching problem by solving the maximum two-independent set problem
作者: Hsiao, Ju-Yuan;Tang, C. Y.;Chang, R. S.
贡献者: 資訊工程系
关键词: Combinational problems;Design of algorithms
日期: 1991-09
上传时间: 2012-05-02T09:39:00Z
摘要: The problem of single step searching a graph is investigated. We show that this problem can be solved by solving the maximum two-independent set problem. Results about solving the single step graph searching problem on special graphs are listed.
關聯: The National Computer Symposium, Chungli, Taiwan, 1, 1991年9月: 206-211
显示于类别:[資訊工程學系] 會議論文

文件中的档案:

档案 大小格式浏览次数
2050400416001.pdf11KbAdobe PDF476检视/开启


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

 


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