×

zbMATH — the first resource for mathematics

Monotonicity in graph searching. (English) Zbl 0760.05081
Summary: We give a new proof of the result, due to A. LaPaugh, that a graph may be optimally “searched” without clearing any edge twice.

MSC:
05C85 Graph algorithms (graph-theoretic aspects)
68R10 Graph theory (including graph drawing) in computer science
90B40 Search theory
PDF BibTeX XML Cite
Full Text: DOI