Memory Efficient Anonymous Graph Exploration (Q5302040): Difference between revisions

@@ Property / cites work @@
+Exploring Unknown Environments
@@ Property / cites work: Exploring Unknown Environments / rank @@
+Normal rank
@@ Property / cites work @@
+On the time taken by random walks on finite groups to visit every state
+Normal rank
@@ Property / cites work @@
+Universal sequences for complete graphs
@@ Property / cites work: Universal sequences for complete graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Many Random Walks Are Faster Than One
@@ Property / cites work: Many Random Walks Are Faster Than One / rank @@
+Normal rank
@@ Property / cites work @@
+Piecemeal graph exploration by a mobile robot.
@@ Property / cites work: Piecemeal graph exploration by a mobile robot. / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on Universal Sequences
@@ Property / cites work: Bounds on Universal Sequences / rank @@
+Normal rank
@@ Property / cites work @@
+The power of a pebble: Exploring and mapping directed graphs
+Normal rank
@@ Property / cites work @@
+Traversing Directed Eulerian Mazes
@@ Property / cites work: Traversing Directed Eulerian Mazes / rank @@
+Normal rank
@@ Property / cites work @@
+Navigating in Unfamiliar Geometric Terrain
@@ Property / cites work: Navigating in Unfamiliar Geometric Terrain / rank @@
+Normal rank
@@ Property / cites work @@
+Universal traversal sequences for paths and cycles
+Normal rank
@@ Property / cites work @@
+Trading Space for Time in Undirected <i>s</i>-<i>t</i> Connectivity
+Normal rank
@@ Property / cites work @@
+Automata and Labyrinths
@@ Property / cites work: Automata and Labyrinths / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on universal traversal sequences based on chains of length five
+Normal rank
@@ Property / cites work @@
+The electrical resistance of a graph captures its commute and cover times
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Space Lower Bounds for Maze Threadability on Restricted Machines
+Normal rank
@@ Property / cites work @@
+The Cover Time of Random Regular Graphs
@@ Property / cites work: The Cover Time of Random Regular Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Crawling on web graphs
@@ Property / cites work: Crawling on web graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Multiple Random Walks in Random Regular Graphs
@@ Property / cites work: Multiple Random Walks in Random Regular Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A randomized algorithm for the joining protocol in dynamic distributed networks
+Normal rank
@@ Property / cites work @@
+Simulating a Random Walk with Constant Error
@@ Property / cites work: Simulating a Random Walk with Constant Error / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579495
@@ Property / cites work: Q3579495 / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic random walks on the integers
@@ Property / cites work: Deterministic random walks on the integers / rank @@
+Normal rank
@@ Property / cites work @@
+More efficient periodic traversal in anonymous undirected graphs
+Normal rank
@@ Property / cites work @@
+How to learn an unknown environment. I
@@ Property / cites work: How to learn an unknown environment. I / rank @@
+Normal rank
@@ Property / cites work @@
+Exploring an unknown graph
@@ Property / cites work: Exploring an unknown graph / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal graph exploration without good maps
@@ Property / cites work: Optimal graph exploration without good maps / rank @@
+Normal rank
@@ Property / cites work @@
+Tree exploration with little memory
@@ Property / cites work: Tree exploration with little memory / rank @@
+Normal rank
@@ Property / cites work @@
+Structural Information and Communication Complexity
+Normal rank
@@ Property / cites work @@
+Deterministic Random Walks on the Two-Dimensional Grid
+Normal rank
@@ Property / cites work @@
+Optimal constrained graph exploration
@@ Property / cites work: Optimal constrained graph exploration / rank @@
+Normal rank
@@ Property / cites work @@
+A tight upper bound on the cover time for random walks on graphs
+Normal rank
@@ Property / cites work @@
+A tight lower bound on the cover time for random walks on graphs
+Normal rank
@@ Property / cites work @@
+Collecting coupons on trees, and the cover time of random walks
+Normal rank
@@ Property / cites work @@
+On the impact of sense of direction on message complexity
+Normal rank
@@ Property / cites work @@
+Sense of direction: Definitions, properties, and classes
+Normal rank
@@ Property / cites work @@
+Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)
+Normal rank
@@ Property / cites work @@
+STACS 2004
@@ Property / cites work: STACS 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph exploration by a finite automaton
@@ Property / cites work: Graph exploration by a finite automaton / rank @@
+Normal rank
@@ Property / cites work @@
+The Planar Hamiltonian Circuit Problem is NP-Complete
+Normal rank
@@ Property / cites work @@
+Fast periodic graph exploration with constant memory
+Normal rank
@@ Property / cites work @@
+Q2934641
@@ Property / cites work: Q2934641 / rank @@
+Normal rank
@@ Property / cites work @@
+Universal traversal sequences for expander graphs
@@ Property / cites work: Universal traversal sequences for expander graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4449241
@@ Property / cites work: Q4449241 / rank @@
+Normal rank
@@ Property / cites work @@
+Setting Port Numbers for Fast Graph Exploration
@@ Property / cites work: Setting Port Numbers for Fast Graph Exploration / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudorandomness for network algorithms
@@ Property / cites work: Pseudorandomness for network algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Universal traversal sequences of length \(n^{0(\log \,n)}\) for cliques
+Normal rank
@@ Property / cites work @@
+Universal traversal sequences with backtracking.
@@ Property / cites work: Universal traversal sequences with backtracking. / rank @@
+Normal rank
@@ Property / cites work @@
+Log-space constructible universal traversal sequences for cycles of length O(\(n^{4.03}\)).
+Normal rank
@@ Property / cites work @@
+Q3890117
@@ Property / cites work: Q3890117 / rank @@
+Normal rank
@@ Property / cites work @@
+Impact of topographic information on graph exploration efficiency
+Normal rank
@@ Property / cites work @@
+Undirected ST-connectivity in log-space
@@ Property / cites work: Undirected ST-connectivity in log-space / rank @@
+Normal rank
@@ Property / cites work @@
+Automaten in planaren Graphen
@@ Property / cites work: Automaten in planaren Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+The cover time of a regular expander is O(n log n)
+Normal rank
@@ Property / cites work @@
+Multiple cover time
@@ Property / cites work: Multiple cover time / rank @@
+Normal rank
@@ Property / cites work @@
+A distributed ant algorithm for efficiently patrolling a network
+Normal rank
@@ Property / cites work @@
+A Technique for Lower Bounding the Cover Time
@@ Property / cites work: A Technique for Lower Bounding the Cover Time / rank @@
+Normal rank