The nearest colored node in a tree

Keyphrases

• Log-log 100%
• Update Time 100%
• Time Algorithm 50%
• General Graphs 50%
• Subcubic 50%
• All-pairs Shortest Paths 50%
• Query Response Time 50%
• Node-based Approach 50%
• Color number 50%
• Tree-based 50%
• Nearest Nodes 50%
• Weighted Edge 50%
• Dynamic Setting 50%
• Top Trees 50%
• Efficient Data Structures 50%
• Sublinear Update Time 50%

Computer Science

• Data Structure 100%
• Pair Shortest Path Problem 50%