Monotonicity in graph searching

D. Bienstock, Paul Seymour

Research output: Contribution to journalArticlepeer-review

206 Scopus citations


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 languageEnglish (US)
Pages (from-to)239-245
Number of pages7
JournalJournal of Algorithms
Issue number2
StatePublished - Jun 1991
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Control and Optimization
  • Computational Mathematics
  • Computational Theory and Mathematics


Dive into the research topics of 'Monotonicity in graph searching'. Together they form a unique fingerprint.

Cite this