Searching by Heterogeneous Agents

05/06/2021
by   Dariusz Dereniowski, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/22/2018

Recognizing Graph Search Trees

Graph searches and the corresponding search trees can exhibit important ...
research
04/22/2022

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

We consider the mixed search game against an agile and visible fugitive....
research
08/31/2017

Simple Compact Monotone Tree Drawings

A monotone drawing of a graph G is a straight-line drawing of G such tha...
research
08/20/2020

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...
research
07/24/2020

Computing nearest neighbour interchange distances between ranked phylogenetic trees

Many popular algorithms for searching the space of leaf-labelled trees a...
research
02/16/2018

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

Many problems in areas as diverse as recommendation systems, social netw...
research
03/30/2021

On AO*, Proof Number Search and Minimax Search

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

Please sign up or login with your details

Forgot password? Click here to reset