Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents
Work
Year: 2019
Type: article
Abstract: We study the problem of deterministically exploring an undirected and initially unknown graph with n vertices either by a single agent equipped with a set of pebbles or by a set of collaborating agent... more
Source: Journal of the ACM
Authors Yann Disser, Jan Hackfeld, Max Klimm
Cites: 41
Cited by: 17
Related to: 10
FWCI: 1.651
Citation percentile (by year/subfield): 100
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green