National Changhua University of Education Institutional Repository : Item 987654321/9988
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 6507/11669
造訪人次 : 30697212      線上人數 : 265
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 進階搜尋

請使用永久網址來引用或連結此文件: 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 PDF513檢視/開啟


在NCUEIR中所有的資料項目都受到原著作權保護.

 


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