Universal traversal sequences with backtracking.
From MaRDI portal
Recommendations
- Universal traversal sequences for paths and cycles
- Universal traversal sequences for expander graphs
- Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs
- Universal traversal sequences of length \(n^{0(\log \,n)}\) for cliques
- Lower bounds on the length of universal traversal sequences
Cites work
- scientific article; zbMATH DE number 3519671 (Why is no real title available?)
- scientific article; zbMATH DE number 1256637 (Why is no real title available?)
- scientific article; zbMATH DE number 1796968 (Why is no real title available?)
- Bounds on Universal Sequences
- Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs
- Lower bounds on the length of universal traversal sequences
- Lower bounds on universal traversal sequences based on chains of length five
- On the cover time of random walks on graphs
- Pseudorandom generators for space-bounded computation
- Pseudorandomness for network algorithms
- The electrical resistance of a graph captures its commute and cover times
- Universal sequences for complete graphs
- Universal traversal sequences for expander graphs
- Universal traversal sequences for paths and cycles
- Universal traversal sequences of length \(n^{0(\log \,n)}\) for cliques
Cited in
(17)- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Deterministic symmetric rendezvous in arbitrary graphs: overcoming anonymity, failures and uncertainty
- Rendezvous in networks in spite of delay faults
- Deterministic network exploration by a single agent with Byzantine tokens
- Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers
- Memory Efficient Anonymous Graph Exploration
- Randomized and Symmetric Catalytic Computation
- The isomorphism problem for planar 3-connected graphs is in unambiguous logspace
- Universal traversal sequences for paths and cycles
- scientific article; zbMATH DE number 3911721 (Why is no real title available?)
- Different speeds suffice for rendezvous of two agents on arbitrary graphs
- Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences
- Almost universal anonymous rendezvous in the plane
- Want to gather? No need to chatter!
- Universal traversal sequences for expander graphs
- How much memory is needed for leader election
- Derandomizing random walks in undirected graphs using locally fair exploration strategies
This page was built for publication: Universal traversal sequences with backtracking.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1872734)
