B. v.Stengel and R. Werchner, \Complexity of searching an immobile hider in a graph", Discrete Applied Mathematics 78, pp. 235-249, 1997. 18  Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Scheduling Search Procedures: The Wheel of Fortune - Damaschke (Correct)
No context found.
B. v.Stengel and R. Werchner, \Complexity of searching an immobile hider in a graph", Discrete Applied Mathematics 78, pp. 235-249, 1997. 18
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC