Edge exploration of anonymous graph by mobile agent with external help
From MaRDI portal
Publication:6488105
DOI10.1007/S00607-022-01136-8zbMath1519.68187MaRDI QIDQ6488105
Barun Gorain, Shaswati Patra, Kaushik Mondal, Rishi Ranjan Singh, Amit Kumar Dhar
Publication date: 24 March 2023
Published in: Computing (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Topology recognition with advice
- Online computation with advice
- Trade-offs between the size of advice and broadcasting time in trees
- Local MST computation with short advice
- Tree exploration with advice
- Fast radio broadcasting with advice
- Communication algorithms with advice
- Graph searching with advice
- Lower bounds on the length of universal traversal sequences
- Piecemeal graph exploration by a mobile robot.
- The power of a pebble: Exploring and mapping directed graphs
- Online graph exploration: New results on old and new algorithms
- Proof labeling schemes
- Distributed computing with advice: information sensitivity of graph coloring
- Finding the size and the diameter of a radio network using short labels
- Online Graph Exploration with Advice
- EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN
- Optimal constrained graph exploration
- Undirected connectivity in log-space
- Deterministic Graph Exploration with Advice
- Tree exploration with little memory
- Distance labeling in graphs
- Label-guided graph exploration by a finite automaton
- STACS 2004
- Short labeling schemes for topology recognition in wireless tree networks
This page was built for publication: Edge exploration of anonymous graph by mobile agent with external help
