Pages that link to "Item:Q4533473"
From MaRDI portal
The following pages link to Rendezvous search on labeled networks (Q4533473):
Displayed 27 items.
- Anonymous meeting in networks (Q262278) (← links)
- The kissing problem: how to end a gathering when everyone kisses everyone else goodbye (Q489765) (← links)
- Asynchronous deterministic rendezvous in bounded terrains (Q650932) (← links)
- Rendezvous search on a star graph with examination costs (Q872266) (← links)
- Fast rendezvous with advice (Q896137) (← links)
- How to meet in anonymous network (Q930910) (← links)
- Use of information, memory and randomization in asynchronous gathering (Q1745729) (← links)
- How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363) (← links)
- A symbolic programming approach to the rendezvous search problem (Q2120120) (← links)
- Social distancing, gathering, search games: mobile agents on simple networks (Q2128973) (← links)
- Search-and-rescue rendezvous (Q2242258) (← links)
- Time versus space trade-offs for rendezvous in trees (Q2251152) (← links)
- Deterministic rendezvous with different maps (Q2323344) (← links)
- Deterministic polynomial approach in the plane (Q2353250) (← links)
- Asynchronous deterministic rendezvous in graphs (Q2369001) (← links)
- A common notion of clockwise can help in planar rendezvous (Q2433433) (← links)
- Line-of-sight rendezvous (Q2475830) (← links)
- Rendezvous in networks in spite of delay faults (Q2629214) (← links)
- Price of asynchrony in mobile agents computing (Q2637351) (← links)
- Ten Open Problems in Rendezvous Search (Q2961406) (← links)
- Rendezvous search with markers that can be dropped at chosen times (Q3120081) (← links)
- Asynchronous Deterministic Rendezvous on the Line (Q3599098) (← links)
- How to meet asynchronously at polynomial cost (Q5176086) (← links)
- On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous (Q5245013) (← links)
- (Q5743418) (← links)
- Time versus cost tradeoffs for deterministic rendezvous in networks (Q5964898) (← links)
- Almost universal anonymous rendezvous in the plane (Q6046947) (← links)