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
Fingerprint Dive into the research topics of 'Solving the single step graph searching problem by solving the maximum two-independent set problem'. Together they form a unique fingerprint.
Cite this
Hsiao, J. Y., Tang, C. Y., & Chang, R. S. (1991). Solving the single step graph searching problem by solving the maximum two-independent set problem. Information Processing Letters, 40(5), 283-287. https://doi.org/10.1016/0020-0190(91)90124-Z