Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple ..."

Yann Disser, Jan Hackfeld, Max Klimm (2019)

> Home

Details and statistics

DOI: 10.1145/3356883

access: closed

type: Journal Article

metadata version: 2022-01-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/DisserHK19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/DisserHK19
Yann Disser, Jan Hackfeld, Max Klimm:
Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents. J. ACM 66(6): 40:1-40:41 (2019)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.