Complexity of searching for a black hole

Jurek Czyzowicz, Dariusz Kowalski, Euripides Markou, Andrzej Pelc

Research output: Contribution to journalArticle

Abstract

A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the task of locating a black hole in a (partially) synchronous network, assuming an upper bound on the time of any edge traversal by an agent. The minimum number of agents capable to identify a black hole is two. For a given graph and given starting node we are interested in the fastest possible black hole search by two agents, under the general scenario in which some subset of nodes is safe and the black hole can be located in one of the remaining nodes. We show that the problem of finding the fastest possible black hole search scheme by two agents is NP-hard, and we give a 9.3-approximation for it.

Original languageEnglish (US)
Pages (from-to)229-242
Number of pages14
JournalFundamenta Informaticae
Volume71
Issue number2-3
StatePublished - Jun 22 2006
Externally publishedYes

Fingerprint

Mobile agents
Black Holes
Vertex of a graph
Mobile Agent
Stationary Process
NP-complete problem
Trace
Upper bound
Scenarios
Subset
Approximation
Graph in graph theory

Keywords

  • Approximation algorithm
  • Black hole
  • Graph
  • Mobile agent
  • NP-hard problem

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Algebra and Number Theory
  • Information Systems
  • Computational Theory and Mathematics

Cite this

Czyzowicz, J., Kowalski, D., Markou, E., & Pelc, A. (2006). Complexity of searching for a black hole. Fundamenta Informaticae, 71(2-3), 229-242.

Complexity of searching for a black hole. / Czyzowicz, Jurek; Kowalski, Dariusz; Markou, Euripides; Pelc, Andrzej.

In: Fundamenta Informaticae, Vol. 71, No. 2-3, 22.06.2006, p. 229-242.

Research output: Contribution to journalArticle

Czyzowicz, J, Kowalski, D, Markou, E & Pelc, A 2006, 'Complexity of searching for a black hole', Fundamenta Informaticae, vol. 71, no. 2-3, pp. 229-242.
Czyzowicz J, Kowalski D, Markou E, Pelc A. Complexity of searching for a black hole. Fundamenta Informaticae. 2006 Jun 22;71(2-3):229-242.
Czyzowicz, Jurek ; Kowalski, Dariusz ; Markou, Euripides ; Pelc, Andrzej. / Complexity of searching for a black hole. In: Fundamenta Informaticae. 2006 ; Vol. 71, No. 2-3. pp. 229-242.
@article{fefb0d16df0f469987c00d967e8a9f2d,
title = "Complexity of searching for a black hole",
abstract = "A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the task of locating a black hole in a (partially) synchronous network, assuming an upper bound on the time of any edge traversal by an agent. The minimum number of agents capable to identify a black hole is two. For a given graph and given starting node we are interested in the fastest possible black hole search by two agents, under the general scenario in which some subset of nodes is safe and the black hole can be located in one of the remaining nodes. We show that the problem of finding the fastest possible black hole search scheme by two agents is NP-hard, and we give a 9.3-approximation for it.",
keywords = "Approximation algorithm, Black hole, Graph, Mobile agent, NP-hard problem",
author = "Jurek Czyzowicz and Dariusz Kowalski and Euripides Markou and Andrzej Pelc",
year = "2006",
month = "6",
day = "22",
language = "English (US)",
volume = "71",
pages = "229--242",
journal = "Fundamenta Informaticae",
issn = "0169-2968",
publisher = "IOS Press",
number = "2-3",

}

TY - JOUR

T1 - Complexity of searching for a black hole

AU - Czyzowicz, Jurek

AU - Kowalski, Dariusz

AU - Markou, Euripides

AU - Pelc, Andrzej

PY - 2006/6/22

Y1 - 2006/6/22

N2 - A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the task of locating a black hole in a (partially) synchronous network, assuming an upper bound on the time of any edge traversal by an agent. The minimum number of agents capable to identify a black hole is two. For a given graph and given starting node we are interested in the fastest possible black hole search by two agents, under the general scenario in which some subset of nodes is safe and the black hole can be located in one of the remaining nodes. We show that the problem of finding the fastest possible black hole search scheme by two agents is NP-hard, and we give a 9.3-approximation for it.

AB - A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the task of locating a black hole in a (partially) synchronous network, assuming an upper bound on the time of any edge traversal by an agent. The minimum number of agents capable to identify a black hole is two. For a given graph and given starting node we are interested in the fastest possible black hole search by two agents, under the general scenario in which some subset of nodes is safe and the black hole can be located in one of the remaining nodes. We show that the problem of finding the fastest possible black hole search scheme by two agents is NP-hard, and we give a 9.3-approximation for it.

KW - Approximation algorithm

KW - Black hole

KW - Graph

KW - Mobile agent

KW - NP-hard problem

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

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

M3 - Article

AN - SCOPUS:33745119003

VL - 71

SP - 229

EP - 242

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

SN - 0169-2968

IS - 2-3

ER -