Pages that link to "Item:Q1872734"
From MaRDI portal
The following pages link to Universal traversal sequences with backtracking. (Q1872734):
Displayed 6 items.
- Deterministic network exploration by a single agent with Byzantine tokens (Q436569) (← links)
- How much memory is needed for leader election (Q661049) (← links)
- Derandomizing random walks in undirected graphs using locally fair exploration strategies (Q661051) (← links)
- How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363) (← links)
- The isomorphism problem for planar 3-connected graphs is in unambiguous logspace (Q1959391) (← links)
- Memory Efficient Anonymous Graph Exploration (Q5302040) (← links)