The nearest colored node in a tree

DOI10.4230/LIPICS.CPM.2016.25MaRDI QIDQ5369560zbMATH OpenOpenAlexFDO

Authors Paweł Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann

Publication date 17 October 2017

Full work available at URL https://doi.org/10.4230/LIPIcs.CPM.2016.25

zbMATH Keywords

marked ancestornearest colored descendanttop-treesvertex-label distance oracles

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The nearest colored node in a tree
• Succinct data structures for nearest colored node in a tree
• scientific article; zbMATH DE number 4047158
• The nearest common ancestor in a dynamic tree
• Path minima queries in dynamic weighted trees

Cited in

(3)

• The nearest colored node in a tree
• Succinct data structures for nearest colored node in a tree
• On the complexity of the (approximate) nearest colored node problem

This page was built for publication: The nearest colored node in a tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5369560)