Edge searching weighted graphs

Authors:
Öznur Yaşar;Danny Dyer;David A. Pike;Margo Kondratieva
Affiliations:
Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, NL, Canada;Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, NL, Canada;Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, NL, Canada;Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, NL, Canada
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 7
Cited 1

Searching and pebbling

Theoretical Computer Science
The complexity of searching a graph

Journal of the ACM (JACM)
Monotonicity in graph searching

Journal of Algorithms
The vertex separation number of a graph equals its path-width

Information Processing Letters
Recontamination does not help to search a graph

Journal of the ACM (JACM)
The vertex separation and search number of a graph

Information and Computation
Capture of an intruder by mobile agents

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures

Connected searching of weighted trees

Theoretical Computer Science

Quantified Score

Hi-index	0.05

Visualization

Abstract

In traditional edge searching one tries to clean all of the edges in a graph employing the least number of searchers. It is assumed that each edge of the graph initially has a weight equal to one. In this paper we modify the problem and introduce the Weighted Edge Searching Problem by considering graphs with arbitrary positive integer weights assigned to its edges. We give bounds on the weighted search number in terms of related graph parameters including pathwidth. We characterize the graphs for which two searchers are sufficient to clear all edges. We show that for every weighted graph the minimum number of searchers needed for a not-necessarily-monotonic weighted edge search strategy is enough for a monotonic weighted edge search strategy, where each edge is cleaned only once. This result proves the NP-completeness of the problem.