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