Theoretical Computer Science
Scheduling computer and manufacturing processes
Scheduling computer and manufacturing processes
Capture of an intruder by mobile agents
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Operations Research
Contiguous Search in the Hypercube for Capturing an Intruder
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
Decontamination of hypercubes by mobile agents
Networks - Games, Interdiction, and Human Interaction Problems on Networks
Efficient Multi-robot Search for a Moving Target
International Journal of Robotics Research
Scheduling Algorithms
Edge searching weighted graphs
Discrete Applied Mathematics
Connected graph searching in chordal graphs
Discrete Applied Mathematics
Pathwidth is NP-Hard for Weighted Trees
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Algorithms and complexity results for pursuit-evasion problems
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Pursuit-evasion on trees by robot teams
IEEE Transactions on Robotics
Improving the Efficiency of Clearing with Multi-agent Teams
International Journal of Robotics Research
Connected searching of weighted trees
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Capturing an intruder in the pyramid
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Connected treewidth and connected graph searching
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
A graph search algorithm for indoor pursuit/evasion
Mathematical and Computer Modelling: An International Journal
Information and Computation
Approximate search strategies for weighted trees
Theoretical Computer Science
| Hi-index | 5.23 |
In this paper we consider the problem of connected edge searching of weighted trees. Barriere et al. claim in [L. Barriere, P. Flocchini, P. Fraigniaud, N. Santoro, Capture of an intruder by mobile agents, in: SPAA'02: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, ACM, New York, NY, USA, 2002, pp. 200-209] that there exists a polynomial-time algorithm for finding an optimal search strategy, that is, a strategy that minimizes the number of used searchers. However, due to some flaws in their algorithm, the problem turns out to be open. It is proven in this paper that the considered problem is strongly NP-complete even for node-weighted trees (the weight of each edge is 1) with one vertex of degree greater than 2. It is also shown that there exists a polynomial-time algorithm for finding an optimal connected search strategy for a given bounded degree tree with arbitrary weights on the edges and on the vertices. This is an FPT algorithm with respect to the maximum degree of a tree.