Pages that link to "Item:Q5919050"
From MaRDI portal
The following pages link to Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement (Q5919050):
Displaying 14 items.
- Complete visibility for robots with lights in \(\mathrm{O}(1)\) time (Q2007914) (← links)
- On the mutual visibility in Cartesian products and triangle-free graphs (Q2096353) (← links)
- Fault-induced dynamics of oblivious robots on a line (Q2304522) (← links)
- Mutual visibility in graphs (Q2668324) (← links)
- Mutual visibility on grid by asynchronous luminous robots (Q2672588) (← links)
- Optimum Algorithm for Mutual Visibility Among Asynchronous Robots with Lights (Q5045451) (← links)
- Variety of mutual-visibility problems in graphs (Q6049930) (← links)
- Mutual-visibility sets in Cartesian products of paths and cycles (Q6196223) (← links)
- Mutual-visibility problems on graphs of diameter two (Q6568863) (← links)
- Mutual visibility of luminous robots despite angular inaccuracy (Q6590092) (← links)
- Mutual-visibility in strong products of graphs via total mutual-visibility (Q6611058) (← links)
- Fault-tolerant mutual visibility without any axis agreement in presence of mobility failure (Q6652472) (← links)
- The \(k\)-distance mutual-visibility problem in graphs (Q6661087) (← links)
- Total mutual-visibility in Hamming graphs (Q6667291) (← links)
