DeepAI AI Chat
Log In Sign Up

Searching by Heterogeneous Agents

by   Dariusz Dereniowski, et al.
Gdańsk University of Technology
Okręgowa Izba Radców Prawnych w Gdańsku
University of Gdańsk

In this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs: once a search strategy initially assigns labels to the searchers, each searcher can be only present on an edge of its own label. We prove that this problem is not monotone even for trees and we give instances in which the number of recontamination events is asymptotically quadratic in the tree size. Other negative results regard the NP-completeness of the monotone, and NP-hardness of an arbitrary (i.e., non-monotone) heterogeneous search in trees. These properties show that this problem behaves very differently from the classical edge search. On the other hand, if all edges of a particular label form a (connected) subtree of the input tree, then we show that optimal heterogeneous search strategy can be computed efficiently.


page 1

page 2

page 3

page 4


Recognizing Graph Search Trees

Graph searches and the corresponding search trees can exhibit important ...

The mixed search game against an agile and visible fugitive is monotone

We consider the mixed search game against an agile and visible fugitive....

Simple Compact Monotone Tree Drawings

A monotone drawing of a graph G is a straight-line drawing of G such tha...

Plane Spanning Trees in Edge-Colored Simple Drawings of K_n

Károlyi, Pach, and Tóth proved that every 2-edge-colored straight-line d...

Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs

Many problems in areas as diverse as recommendation systems, social netw...

Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings

In phylogenetics, tree-based networks are used to model and visualize th...

On AO*, Proof Number Search and Minimax Search

We discuss the interconnections between AO*, adversarial game-searching ...