Synchronization Helps Robots to Detect Black Holes in Directed Graphs
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Almost optimal asynchronous rendezvous in infinite multidimensional grids
DISC'10 Proceedings of the 24th international conference on Distributed computing
Synchronous black hole search in directed graphs
Theoretical Computer Science
More efficient periodic traversal in anonymous undirected graphs
Theoretical Computer Science
Hi-index | 0.03 |
Let V = {x1,...,xn} be a set of variables that range over a set of values D = {d1,...,dq}. A constraint is an expression of the type $R(x_{i_1},\ldots,x_{i_r})$, ...