2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DM2009
More efficient periodic traversal in anonymous undirected graphs
J. Czyzowicz, S. Dobrev, L. Gasieniec +7
We consider the problem of periodic graph exploration in which a mobile entity with constant memory, an agent, has to visit all n nodes of an arbitrary undirected graph G in a peri…
cs.DS2006★ 2 cited
Practical Entropy-Compressed Rank/Select Dictionary
Daisuke Okanohara, Kunihiko Sadakane
Rank/Select dictionaries are data structures for an ordered set to compute $\rank(x,S)$ (the number of elements in which are no greater than ), a…