National Changhua University of Education Institutional Repository : Item 987654321/9974

English | 正體中文 | 简体中文 | Items with full text/Total items : 6507/11669
Visitors : 29934533 Online Users : 435

RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Scope Adv. Search

Login ‧ Upload ‧ Help ‧ About ‧ Administer

NCUEIR > College of Engineering > Department and Graduate Institute of Computer Science and Information Engineering > Periodical Articles > Item 987654321/9974

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/9974

Title:	Solving the single step graph searching problem by solving the maximum two-independent set problem
Authors:	Hsiao, Ju-Yuan;Tang, C. Y.;Chang, R. S.
Contributors:	資訊工程系
Keywords:	Combinational problems;Design of algorithms
Date:	1991-12
Issue Date:	2012-05-02T09:36:33Z
Publisher:	Elsevier BV
Abstract:	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.
Relation:	Information Processing Letters, 40(5): 283-287
Appears in Collections:	[Department and Graduate Institute of Computer Science and Information Engineering] Periodical Articles

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	664	View/Open