Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents.
Yann DisserJan HackfeldMax KlimmPublished in: J. ACM (2019)
Keyphrases
- multiple agents
- tight bounds
- undirected graph
- upper bound
- multi agent
- directed graph
- approximation algorithms
- single agent
- spanning tree
- connected components
- minimum cost
- directed acyclic graph
- complex networks
- positive integer
- lower bound
- random graphs
- multi agent coordination
- graph structure
- preference relations
- agent societies
- computer vision
- random walk
- np hard
- adjacency matrix
- special case
- database systems
- machine learning
- multi dimensional