_:N4b7970be55534e728bd8a1b9558eaa38 .
.
"2009-02" .
"2009-02-01" .
_:N799f51f0a73c4e7ca4e50fa413a9865f "2" .
.
.
.
"186-204" .
.
.
.
"1433-0490" .
.
.
_:N605379779d6f457db28d9b8eb5ca7854 .
_:N5e19d29234e341c88cbcbbe79972fce2 "doi" .
.
.
_:N4482178b7b6d41088b5f6dba1719941a .
_:N234b650cb39f464b904c41dabef5c282 .
"1432-4350" .
"Luccio" .
.
.
_:N605379779d6f457db28d9b8eb5ca7854 .
.
"Contiguous Search Problem in Sierpi\u0144ski Graphs" .
.
_:Nf3c6c979fbd044f2a8a6baa7dca5e9d9 .
.
"en" .
.
.
"Flaminia L." .
.
.
_:Nf3c6c979fbd044f2a8a6baa7dca5e9d9 "Springer Nature - SN SciGraph project" .
_:N5e19d29234e341c88cbcbbe79972fce2 .
.
.
.
"In this paper we consider the problem of capturing an intruder in a particular fractal graph, the Sierpi\u0144ski graph SGn. The problem consists of having a team of mobile software agents that collaborate in order to capture the intruder. The intruder is a mobile entity that escapes from the team of agents, moving arbitrarily fast inside the network, i.e., traversing any number of contiguous nodes as long as no other agent resides on them. The agents move asynchronously and they know the network topology they are in is a Sierpi\u0144ski graph SGn. We first derive lower bounds on the minimum number of agents, number of moves and time steps required to capture the intruder. We then consider some variations of the model based on the capabilities of the agents: visibility, where the agents can \u201Csee\u201D the state of their neighbors and thus can move autonomously; locality, where the agents can only access local information and thus their moves have to be coordinated by a leader. For each model, we design a capturing strategy and we make some observations. One of our goals is to continue a previous study on what is the impact of visibility on complexity: in this topology we are able to reach an optimal bound on the number of agents required by both cleaning strategies. However, the strategy in the visibility model is fully distributed, whereas the other strategy requires a leader. Moreover, the second strategy requires a higher number of moves and time steps." .
_:N799f51f0a73c4e7ca4e50fa413a9865f .
_:N4482178b7b6d41088b5f6dba1719941a "readcube_id" .
_:N4482178b7b6d41088b5f6dba1719941a "5c7d5428ab6aea16b189106e8b67769b318233d42ec61d0e1cc1293dff1807a2" .
"articles" .
.
.
.
.
_:N4b7970be55534e728bd8a1b9558eaa38 "pub.1019411622" .
.
.
_:N4b7970be55534e728bd8a1b9558eaa38 "dimensions_id" .
.
"https://scigraph.springernature.com/explorer/license/" .
.
.
_:N234b650cb39f464b904c41dabef5c282 .
.
.
.
.
"Dipartimento di Informatica, Universit\u00E0 Ca\u2019 Foscari Venezia, via Torino 155, 30172, Venice, Italy" .
"http://link.springer.com/10.1007/s00224-008-9116-z" .
"research_article" .
.
.
.
.
.
.
"Theory of Computing Systems" .
.
.
.
.
"Computation Theory and Mathematics" .
_:N4b7970be55534e728bd8a1b9558eaa38 .
.
.
.
.
.
.
.
.
_:N234b650cb39f464b904c41dabef5c282 "44" .
.
_:N4482178b7b6d41088b5f6dba1719941a .
.
"Ca Foscari University of Venice" .
.
.
.
.
.
_:N605379779d6f457db28d9b8eb5ca7854 .
.