Tight bounds for undirected graph exploration with pebbles and multiple agents.
Yann DisserJan HackfeldMax KlimmPublished in: CoRR (2018)
Keyphrases
- multiple agents
- tight bounds
- undirected graph
- upper bound
- multi agent
- directed graph
- spanning tree
- approximation algorithms
- single agent
- complex networks
- minimum cost
- connected components
- lower bound
- directed acyclic graph
- random graphs
- graph structure
- positive integer
- multi agent coordination
- agent societies
- random walk
- adjacency matrix
- bayesian networks
- preference relations
- data structure
- preference aggregation