Pages that link to "Item:Q1854539"

The following pages link to The power of a pebble: Exploring and mapping directed graphs (Q1854539):

Displaying 38 items.

• Convergecast and broadcast by power-aware mobile agents (Q261352) (← links)
• Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
• Drawing maps with advice (Q433400) (← links)
• Trade-offs between the size of advice and broadcasting time in trees (Q547287) (← links)
• Derandomizing random walks in undirected graphs using locally fair exploration strategies (Q661051) (← links)
• Exploring an unknown dangerous graph with a constant number of tokens (Q896695) (← links)
• Fast periodic graph exploration with constant memory (Q931724) (← links)
• Setting port numbers for fast graph exploration (Q935169) (← links)
• Impact of memory size on graph exploration capability (Q947116) (← links)
• Tree exploration with advice (Q958304) (← links)
• Communication algorithms with advice (Q972382) (← links)
• Graph searching with advice (Q1008727) (← links)
• Gathering of robots on meeting-points: feasibility and optimal resolution algorithms (Q1699417) (← links)
• Linear search by a pair of distinct-speed robots (Q1755792) (← links)
• Exploring sparse graphs with advice (Q2105435) (← links)
• Building a nest by an automaton (Q2223695) (← links)
• Fast collaborative graph exploration (Q2347797) (← links)
• Robustness of the rotor-router mechanism (Q2408092) (← links)
• Ping pong in dangerous graphs: optimal black hole search with pebbles (Q2429323) (← links)
• Graph exploration by a finite automaton (Q2575752) (← links)
• Grid exploration by a swarm of autonomous robots with minimum repetitions (Q2676467) (← links)
• Linear Search by a Pair of Distinct-Speed Robots (Q2835026) (← links)
• TIME OPTIMAL ALGORITHMS FOR BLACK HOLE SEARCH IN RINGS (Q2905278) (← links)
• Exploration of Faulty Hamiltonian Graphs (Q2970203) (← links)
• More Efficient Periodic Traversal in Anonymous Undirected Graphs (Q3408168) (← links)
• OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT (Q3444845) (← links)
• Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens (Q3540233) (← links)
• Graph exploration with robot swarms (Q3653537) (← links)
• LABEL-GUIDED GRAPH EXPLORATION WITH ADJUSTABLE RATIO OF LABELS (Q4902885) (← links)
• (Q5075773) (← links)
• Exploration of High-Dimensional Grids by Finite Automata (Q5092342) (← links)
• Memory Efficient Anonymous Graph Exploration (Q5302040) (← links)
• Wireless evacuation on \(m\) rays with \(k\) searchers (Q5919422) (← links)
• A general lower bound for collaborative tree exploration (Q5919423) (← links)
• Time versus cost tradeoffs for deterministic rendezvous in networks (Q5964898) (← links)
• Edge exploration of anonymous graph by mobile agent with external help (Q6488105) (← links)
• Exploration of High-Dimensional Grids by Finite State Machines (Q6492093) (← links)
• Graph exploration by a deterministic memoryless automaton with pebbles (Q6585255) (← links)