Recontamination does not help to search a graph
- 1 April 1993
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 40 (2), 224-245
- https://doi.org/10.1145/151261.151263
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Monotonicity in graph searchingJournal of Algorithms, 1991
- On minimizing width in linear layoutsDiscrete Applied Mathematics, 1989
- The complexity of searching a graphJournal of the ACM, 1988
- Searching and pebblingTheoretical Computer Science, 1986
- Topological BandwidthSIAM Journal on Algebraic Discrete Methods, 1985