462 citations · 502 across the 16 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
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.DS2009★ 12 cited
Fully-Functional Static and Dynamic Succinct Trees
Gonzalo Navarro, Kunihiko Sadakane
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any -node static tree can be represented in bits and…