Abstract
We give a new proof of the result, due to A. LaPaugh, that a graph may be optimally "searched" without clearing any edge twice.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 239-245 |
| Number of pages | 7 |
| Journal | Journal of Algorithms |
| Volume | 12 |
| Issue number | 2 |
| DOIs | |
| State | Published - Jun 1991 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Control and Optimization
- Computational Mathematics
- Computational Theory and Mathematics