11 search results - page 3 / 3 » icalp 1992 |
ICALP
1992
Springer
13 years 9 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...