Compact separator decompositions in dynamic trees and applications to labeling schemes

Keyphrases

• Labeling Scheme 100%
• Dynamic Trees 100%
• Dynamic Applications 100%
• Compact Separator 100%
• Separator 60%
• Message Complexity 60%
• Dynamic Separator 60%
• Asymptotically Optimal 40%
• Number of Vertices 20%
• Log-log 20%
• Adversary 20%
• Distance Labeling 20%
• Multiplicative Factors 20%
• Graph Algorithms 20%
• Routing Scheme 20%
• Dynamic Labeling Scheme 20%
• Topology Change 20%
• Static Graph 20%
• Efficient Routing 20%
• Efficient Scheme 20%
• Dynamic Scheme 20%
• Port Model 20%
• Dynamic Distance 20%
• Fundamental Decomposition 20%
• Decomposition Scheme 20%

Computer Science

• Labeling Scheme 100%
• Multiplicative Factor 25%
• routing scheme 25%
• Graph Algorithms 25%
• Topology Change 25%