Exploration of Faulty Hamiltonian Graphs
From MaRDI portal
Publication:2970203
DOI10.1142/S0129054116500313zbMath1404.68082arXiv1602.05136OpenAlexW2963869437MaRDI QIDQ2970203
Publication date: 28 March 2017
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.05136
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Reliability, testing and fault tolerance of networks and computer systems (68M15) Eulerian and Hamiltonian graphs (05C45)
Related Items (1)
Cites Work
- Deterministic network exploration by a single agent with Byzantine tokens
- Searching for black holes in subways
- Optimal graph exploration without good maps
- Fault-tolerant sequential scan
- Efficient exploration of faulty trees
- Locating and repairing faults in a network with mobile agents
- Mobile search for a black hole in an anonymous ring
- Piecemeal graph exploration by a mobile robot.
- The power of a pebble: Exploring and mapping directed graphs
- Exploring an unknown dangerous graph using tokens
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols
- Hardness and approximation results for black hole search in arbitrary networks
- EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN
- Optimal constrained graph exploration
- Approximation bounds for Black Hole Search problems
- How to learn an unknown environment. I
- Online Navigation in a Room
- Navigating in Unfamiliar Geometric Terrain
- Exploring an unknown graph
- Tree exploration with little memory
- Exploring Unknown Undirected Graphs
- Exploring Unknown Environments
- Searching for a Black Hole in Synchronous Tree Networks
- Black hole search in common interconnection networks
This page was built for publication: Exploration of Faulty Hamiltonian Graphs
