Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
21
0

Year Published

2010
2010
2011
2011

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 26 publications
(21 citation statements)
references
References 25 publications
0
21
0
Order By: Relevance
“…This black hole search problem has been originally studied in ring networks [12] and has been extensively investigated in various settings since then (e.g., see [4,6,8,10,13,14,19,24]). In order to locate the black hole, some of the agents of the team will necessarily have to enter the dangerous site.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…This black hole search problem has been originally studied in ring networks [12] and has been extensively investigated in various settings since then (e.g., see [4,6,8,10,13,14,19,24]). In order to locate the black hole, some of the agents of the team will necessarily have to enter the dangerous site.…”
Section: Related Workmentioning
confidence: 99%
“…The case of black links in arbitrary networks has been studied in [2,15], respectively for anonymous and non-anonymous nodes. Black hole search in directed graphs has been investigated for the first time in [4], where it is shown that the requirements in number of agents change considerably. A variant of dangerous node behavior has been studied in [22], where the authors introduce black holes with Byzantine behavior (they do not always destroy a passing agent) and consider the periodic ring exploration problem.…”
Section: Related Workmentioning
confidence: 99%
“…Exploration of unlabeled and unknown digraphs using pebbles to mark vertices, has been studied by Bender et al [6]. A related problem of searching for a black hole has been recently studied for directed graphs (see [9]). …”
Section: Related Workmentioning
confidence: 99%
“…Exploration of unknown and unlabeled graphs (or digraphs) is difficult unless the agents are allowed to mark the nodes. As in several previous papers on the topic [3,4,9,11,13], we allow the agents to mark nodes of the digraphs by writing on whiteboards available at each node.…”
Section: Introductionmentioning
confidence: 99%
“…The problem has also been studied for co-located agents in directed graphs with whiteboards, both in the asynchronous [4] and synchronous cases [16]. A different dangerous behavior is studied for co-located agents in [17], where the authors consider a ring and assume black holes with Byzantine behavior, which do not always destroy a visiting agent.…”
Section: Introductionmentioning
confidence: 99%