The nearest colored node in a tree

@article{Gawrychowski2018TheNC,
  title={The nearest colored node in a tree},
  author={Pawel Gawrychowski and Gad M. Landau and Shay Mozes and Oren Weimann},
  journal={Theor. Comput. Sci.},
  year={2018},
  volume={710},
  pages={66-73}
}
We start a systematic study of data structures for the nearest colored node problem on trees. Given a tree with colored nodes and weighted edges, we want to answer queries (v, c) asking for the nearest node to node v that has color c. This is a natural generalization of the well-known nearest marked ancestor problem. We give an O(n)-space O(log logn)-query solution and show that this is optimal. We also consider the dynamic case where updates can change a node’s color and show that in O(n… CONTINUE READING
BETA

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 20 REFERENCES

The Nearest Colored Node in a Tree

  • P. Bille, G. M. Landau, R. Raman, S. Rao, K. Sadakane, O. Weimann
  • SIAM Journal on Computing (SICOMP),
  • 2015

The power of dynamic distance oracles: Efficient dynamic algorithms for the steiner tree

  • J. Łącki, J. Oćwieja, M. Pilipczuk, P. Sankowski, A. Zych
  • 2015

Similar Papers

Loading similar papers…