National Changhua University of Education Institutional Repository : Item 987654321/9974
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 6507/11669
造访人次 : 29937221      在线人数 : 554
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/9974

题名: 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-12
上传时间: 2012-05-02T09:36:33Z
出版者: Elsevier BV
摘要: 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.
關聯: Information Processing Letters, 40(5): 283-287
显示于类别:[資訊工程學系] 期刊論文

文件中的档案:

档案 大小格式浏览次数
index.html0KbHTML664检视/开启


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

 

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