Exploration of Time-Varying Connected Graphs with Silent Agents
From MaRDI portal
Publication:5100956
DOI10.1007/978-3-030-54921-3_9OpenAlexW3046743058MaRDI QIDQ5100956
Dana Pardubská, Rastislav Královič, Stefan Dobrev
Publication date: 1 September 2022
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-54921-3_9
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)
Cites Work
- Fast periodic graph exploration with constant memory
- Setting port numbers for fast graph exploration
- Automaten in planaren Graphen
- Sense of direction in distributed computing
- A distributed ant algorithm for efficiently patrolling a network
- Distributed exploration of dynamic rings
- Graph decomposition for memoryless periodic exploration
- Graph exploration by a finite automaton
- Tree exploration with logarithmic memory
- On the Power of Local Orientations
- A correctness proof of a topology information maintenance protocol for a distributed computer network
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Exploring an unknown graph
- Exploring Unknown Undirected Graphs
- Exploring Unknown Environments
- Memory Efficient Anonymous Graph Exploration
- Algorithms – ESA 2005
- Structural Information and Communication Complexity
This page was built for publication: Exploration of Time-Varying Connected Graphs with Silent Agents
