Pebble guided near optimal treasure hunt in anonymous graphs

DOI10.1007/978-3-030-79527-6_13OpenAlexW3173504024MaRDI QIDQ2117728FDOQ2117728

Kaushik Mondal, Supantha Pandit, Himadri Nayak, Barun Gorain

Publication date: 22 March 2022

Full work available at URL: https://arxiv.org/abs/2103.05933

zbMATH Keywords

mobile agentanonymous graphpebblestreasure hunt

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites Work

• Searching in the plane
• The theory of search games and rendezvous.
• Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences
• Title not available (Why is that?)
• Label-guided graph exploration by a finite automaton
• Searching for an axis-parallel shoreline
• On the two-dimensional cow search problem
• Online searching with turn cost
• Yet more on the linear search problem
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• Deterministic Graph Exploration with Advice
• Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents
• How many ants does it take to find the food?
• Searching a Tree with Permanently Noisy Advice
• Title not available (Why is that?)
• Advice complexity of treasure hunt in geometric terrains
• Deterministic treasure hunt in the plane with angular hints

Cited In (2)

• Treasure hunt in graph using pebbles
• Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs

This page was built for publication: Pebble guided near optimal treasure hunt in anonymous graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117728)