Pages that link to "Item:Q4291560"

The following pages link to Trading Space for Time in Undirected <i>s</i>-<i>t</i> Connectivity (Q4291560):

Displayed 11 items.

• Tight bounds for the cover time of multiple random walks (Q541669) ‎ (← links)
• Static and expanding grid coverage with ant robots: complexity results (Q638536) ‎ (← links)
• Undirected \(s\)--\(t\) connectivity in polynomial time and sublinear space (Q677988) ‎ (← links)
• A spectrum of time-space trade-offs for undirected \(s-t\) connectivity (Q1356886) ‎ (← links)
• The electrical resistance of a graph captures its commute and cover times (Q1386176) ‎ (← links)
• The cover time of deterministic random walks for general transition probabilities (Q2310755) ‎ (← links)
• The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks (Q2407630) ‎ (← links)
• Memory Efficient Anonymous Graph Exploration (Q5302040) ‎ (← links)
• Reversible random walks on dynamic graphs (Q6063351) ‎ (← links)
• Multiple random walks on graphs: mixing few to cover many (Q6085870) ‎ (← links)
• On a cover time problem on a dynamic graph with steps at random times (Q6165378) ‎ (← links)