Edge exploration of anonymous graph by mobile agent with external help

DOI10.1007/S00607-022-01136-8MaRDI QIDQ6488105zbMATH OpenFDO

Authors A. K. Dhar, Barun Gorain, Kaushik Mondal, Shaswati Patra, Rishi Ranjan Singh

Publication date 24 March 2023

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00607-022-01136-8

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Edge exploration of a graph by mobile agent
• Deterministic Graph Exploration with Advice
• Deterministic graph exploration with advice
• Online graph exploration with advice
• Exploring sparse graphs with advice (extended abstract)

Cites work

• Communication algorithms with advice
• Deterministic graph exploration with advice
• Distance labeling in graphs
• Distributed computing with advice: information sensitivity of graph coloring
• Efficient grid exploration with a stationary token
• Fast radio broadcasting with advice
• Finding the size and the diameter of a radio network using short labels
• Graph searching with advice
• Label-guided graph exploration by a finite automaton
• Local MST computation with short advice
• Lower bounds on the length of universal traversal sequences
• Online computation with advice
• Online graph exploration with advice
• Online graph exploration: New results on old and new algorithms
• Optimal constrained graph exploration
• Piecemeal graph exploration by a mobile robot.
• Proof labeling schemes
• STACS 2004
• The power of a pebble: Exploring and mapping directed graphs
• Topology recognition with advice
• Trade-offs between the size of advice and broadcasting time in trees
• Tree exploration with advice
• Tree exploration with little memory
• Undirected connectivity in log-space

Cited in

(5)

• Anonymous graph exploration with binoculars
• Edge exploration of a graph by mobile agent
• Efficient grid exploration with a stationary token
• Graph covering using bounded size subgraphs
• Collision-free exploration by mobile agents using pebbles

This page was built for publication: Edge exploration of anonymous graph by mobile agent with external help

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488105)