Dereniowski, DariuszDiner, Öznur YaşarDyer, Danny2019-06-272019-06-27201350166-218X0166-218Xhttps://hdl.handle.net/20.500.12469/795https://doi.org/10.1016/j.dam.2013.03.004In the edge searching problem searchers move from vertex to vertex in a graph to capture an invisible fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which at every move a new edge of the graph G must be guaranteed to be free of the intruder. That is once all searchers are placed the graph G is cleared in exactly vertical bar E(G)vertical bar moves. Such a restriction obviously necessitates a larger number of searchers. We examine this model and characterize graphs for which 2 or 3 searchers are sufficient. We prove that the corresponding decision problem is NP-complete. (C) 2013 Elsevier B.V. All rights reserved.eninfo:eu-repo/semantics/openAccessComputational complexityFast searchingGraph searchingArticle1950195813-14161WOS:00032068040001510.1016/j.dam.2013.03.0042-s2.0-84878273364Q3Q2