Searching for an evader in an unknown graph by an optimal number of searchers

Takahiro Yakami, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The graph search problem is the problem of searching a graph G for a mobile evader by mobile searchers. The edge search is an offline and centralized version, and es(G) denotes the number of searchers necessary and sufficient to edge search G. An online and distributed setting assumes a port numbering of G, a distinct homebase and a whiteboard in each node. Search algorithms typically respect the monotone and connected search strategy to protect the information on whiteboards; however, Ω(n/ log n es(G)) searchers are necessary even for trees, where n is the order of G. We investigate the problem under a new online and distributed setting: We assume that searchers can exchange information wherever they meet, instead of assuming a port numbering, a homebase and whiteboards. Under this setting, we propose a search algorithm for es(G) searchers, which is optimal.

Original languageEnglish
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 18th International Symposium, SSS 2016, Proceedings
EditorsFranck Petit, Borzoo Bonakdarpour
PublisherSpringer Verlag
Pages399-414
Number of pages16
ISBN (Print)9783319492582
DOIs
Publication statusPublished - Jan 1 2016
Event18th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2016 - Lyon, France
Duration: Nov 7 2016Nov 10 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10083 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other18th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2016
CountryFrance
CityLyon
Period11/7/1611/10/16

Fingerprint

Unknown
Search Algorithm
Graph in graph theory
Graph Search
Necessary
Search Problems
Search Strategy
Monotone
Sufficient
Denote
Distinct
Vertex of a graph

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Yakami, T., Yamauchi, Y., Kijima, S., & Yamashita, M. (2016). Searching for an evader in an unknown graph by an optimal number of searchers. In F. Petit, & B. Bonakdarpour (Eds.), Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium, SSS 2016, Proceedings (pp. 399-414). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10083 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-49259-9_31

Searching for an evader in an unknown graph by an optimal number of searchers. / Yakami, Takahiro; Yamauchi, Yukiko; Kijima, Shuji; Yamashita, Masafumi.

Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium, SSS 2016, Proceedings. ed. / Franck Petit; Borzoo Bonakdarpour. Springer Verlag, 2016. p. 399-414 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10083 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yakami, T, Yamauchi, Y, Kijima, S & Yamashita, M 2016, Searching for an evader in an unknown graph by an optimal number of searchers. in F Petit & B Bonakdarpour (eds), Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium, SSS 2016, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10083 LNCS, Springer Verlag, pp. 399-414, 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2016, Lyon, France, 11/7/16. https://doi.org/10.1007/978-3-319-49259-9_31
Yakami T, Yamauchi Y, Kijima S, Yamashita M. Searching for an evader in an unknown graph by an optimal number of searchers. In Petit F, Bonakdarpour B, editors, Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium, SSS 2016, Proceedings. Springer Verlag. 2016. p. 399-414. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-49259-9_31
Yakami, Takahiro ; Yamauchi, Yukiko ; Kijima, Shuji ; Yamashita, Masafumi. / Searching for an evader in an unknown graph by an optimal number of searchers. Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium, SSS 2016, Proceedings. editor / Franck Petit ; Borzoo Bonakdarpour. Springer Verlag, 2016. pp. 399-414 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{0d152999778d4eaa81dca7711bb0971a,
title = "Searching for an evader in an unknown graph by an optimal number of searchers",
abstract = "The graph search problem is the problem of searching a graph G for a mobile evader by mobile searchers. The edge search is an offline and centralized version, and es(G) denotes the number of searchers necessary and sufficient to edge search G. An online and distributed setting assumes a port numbering of G, a distinct homebase and a whiteboard in each node. Search algorithms typically respect the monotone and connected search strategy to protect the information on whiteboards; however, Ω(n/ log n es(G)) searchers are necessary even for trees, where n is the order of G. We investigate the problem under a new online and distributed setting: We assume that searchers can exchange information wherever they meet, instead of assuming a port numbering, a homebase and whiteboards. Under this setting, we propose a search algorithm for es(G) searchers, which is optimal.",
author = "Takahiro Yakami and Yukiko Yamauchi and Shuji Kijima and Masafumi Yamashita",
year = "2016",
month = "1",
day = "1",
doi = "10.1007/978-3-319-49259-9_31",
language = "English",
isbn = "9783319492582",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "399--414",
editor = "Franck Petit and Borzoo Bonakdarpour",
booktitle = "Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium, SSS 2016, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Searching for an evader in an unknown graph by an optimal number of searchers

AU - Yakami, Takahiro

AU - Yamauchi, Yukiko

AU - Kijima, Shuji

AU - Yamashita, Masafumi

PY - 2016/1/1

Y1 - 2016/1/1

N2 - The graph search problem is the problem of searching a graph G for a mobile evader by mobile searchers. The edge search is an offline and centralized version, and es(G) denotes the number of searchers necessary and sufficient to edge search G. An online and distributed setting assumes a port numbering of G, a distinct homebase and a whiteboard in each node. Search algorithms typically respect the monotone and connected search strategy to protect the information on whiteboards; however, Ω(n/ log n es(G)) searchers are necessary even for trees, where n is the order of G. We investigate the problem under a new online and distributed setting: We assume that searchers can exchange information wherever they meet, instead of assuming a port numbering, a homebase and whiteboards. Under this setting, we propose a search algorithm for es(G) searchers, which is optimal.

AB - The graph search problem is the problem of searching a graph G for a mobile evader by mobile searchers. The edge search is an offline and centralized version, and es(G) denotes the number of searchers necessary and sufficient to edge search G. An online and distributed setting assumes a port numbering of G, a distinct homebase and a whiteboard in each node. Search algorithms typically respect the monotone and connected search strategy to protect the information on whiteboards; however, Ω(n/ log n es(G)) searchers are necessary even for trees, where n is the order of G. We investigate the problem under a new online and distributed setting: We assume that searchers can exchange information wherever they meet, instead of assuming a port numbering, a homebase and whiteboards. Under this setting, we propose a search algorithm for es(G) searchers, which is optimal.

UR - http://www.scopus.com/inward/record.url?scp=84995663136&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84995663136&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-49259-9_31

DO - 10.1007/978-3-319-49259-9_31

M3 - Conference contribution

AN - SCOPUS:84995663136

SN - 9783319492582

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 399

EP - 414

BT - Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium, SSS 2016, Proceedings

A2 - Petit, Franck

A2 - Bonakdarpour, Borzoo

PB - Springer Verlag

ER -