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.
Original language | English |
---|---|
Pages (from-to) | 283-287 |
Number of pages | 5 |
Journal | Information Processing Letters |
Volume | 40 |
Issue number | 5 |
DOIs | |
Publication status | Published - 1991 Dec 13 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications