Elsevier

Journal of Algorithms

Volume 12, Issue 2, June 1991, Pages 239-245
Journal of Algorithms

Monotonicity in graph searching

https://doi.org/10.1016/0196-6774(91)90003-HGet rights and content

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.

References (8)

  • L.M Kirousis et al.

    Searching and pebbling

    J. Theoret. Comput. Sci.

    (1986)
  • L.M Kirousis et al.

    Interval graphs and searching

    Discrete Math.

    (1985)
  • D. Bienstock, N. Robertson, P. D. Seymour, and R. Thomas, Quickly excluding a forest, J. Combin. Theory Ser. B, to...
  • R.L Breisch

    An intuitive approach to speleotopology

    Southwestern Cavers

    (1967)
There are more references available in the full text version of this article.

Cited by (0)

∗

Current address: Dept. of Industrial Engineering and Operations Research, Columbia University, New York, NY 10027.

View full text
Copyright © 1991 Published by Elsevier Inc.