Exploring an unknown dangerous graph with a constant number of tokens
type: Item
instance of: scholarly article
title: Exploring an unknown dangerous graph with a constant number of tokens
zbMATH Open document ID: 1332.68163
author: B. Balamohan
author: Stefan Dobrev
author: P. Flocchini
author: N. Santoro
published in: Theoretical Computer Science
publication date: 2015-12-10T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 6519465
zbMATH Keywords: black hole
zbMATH Keywords: dangerous networks
zbMATH Keywords: unknown graph exploration
zbMATH Keywords: tokens
zbMATH Keywords: asynchronous mobile agents
zbMATH Keywords: distributed algorithms
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.07.013
OpenAlex ID: W2041241584
cites work: Exploring Unknown Environments
cites work: Time optimal algorithms for black hole search in rings
cites work: The power of a pebble: Exploring and mapping directed graphs
cites work: Black Hole Search with Finite Automata Scattered in a Synchronous Torus
cites work: Tight bounds for black hole search with scattered agents in synchronous rings
cites work: Locating and repairing faults in a network with mobile agents
cites work: Black Hole Search in Directed Graphs
cites work: Q5480656
cites work: Searching for a Black Hole in Synchronous Tree Networks
cites work: Map construction of unknown graphs by multiple agents
cites work: Exploring an unknown graph
cites work: Tree exploration with little memory
cites work: Black hole search in common interconnection networks
cites work: Exploring an unknown dangerous graph using tokens
cites work: Searching for a black hole in arbitrary networks: optimal mobile agents protocols
cites work: Mobile search for a black hole in an anonymous ring
cites work: USING SCATTERED MOBILE AGENTS TO LOCATE A BLACK HOLE IN AN UN-ORIENTED RING WITH TOKENS
cites work: Ping pong in dangerous graphs: optimal black hole search with pebbles
cites work: Searching for black holes in subways
cites work: Collective tree exploration
cites work: Graph exploration by a finite automaton
cites work: Hardness and approximation results for black hole search in arbitrary networks
cites work: Approximation bounds for Black Hole Search problems
cites work: Synchronous black hole search in directed graphs
cites work: Periodic Data Retrieval Problem in Rings Containing a Malicious Host
cites work: Exploring Unknown Undirected Graphs
DOI: 10.1016/J.TCS.2014.07.013
description: scientific article; zbMATH DE number 6519465