The following pages link to Anonymous Meeting in Networks (Q5741761):
Displaying 11 items.
- Anonymous meeting in networks (Q262278) (← links)
- Gathering asynchronous oblivious agents with local vision in regular bipartite graphs (Q392198) (← links)
- How to meet in anonymous network (Q930910) (← links)
- Linear time and space gathering of anonymous mobile agents in asynchronous trees (Q1951563) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
- Deterministic polynomial approach in the plane (Q2353250) (← links)
- Searching on a line: a complete characterization of the optimal solution (Q2513671) (← links)
- Price of asynchrony in mobile agents computing (Q2637351) (← links)
- Deterministic gathering with crash faults (Q4686670) (← links)
- How to meet asynchronously at polynomial cost (Q5176086) (← links)
- Gathering in dynamic rings (Q5919424) (← links)