Logo image
返回
Solving the single step graph searching problem by solving the maximum two-independent set problem
期刊文章   同儕審查

Solving the single step graph searching problem by solving the maximum two-independent set problem

Ju Yuan Hsiao, Chuan Yi Tang 和 Ruay Shiung Chang
Information Processing Letters, 卷.40(5), 頁碼.283-287
12/1991
DOI: https://doi.org/10.1016/0020-0190(91)90124-Z

摘要

Combinational problems design of algorithms Theoretical Computer Science Signal Processing Information Systems Computer Science Applications
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. © 1991.

相關連結

指標

1 檢視次數

詳細資料

Logo image