Dynamic Tree Shortcut with Constant Degree

DOI10.1007/978-3-319-21398-9_34zbMath1465.68210OpenAlexW2240773382MaRDI QIDQ3196404

No author found.

Publication date: 29 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10722/219232

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing on a free tree via complexity-preserving mappings
• Biased skip lists
• A data structure for dynamic trees
• Balancing Degree, Diameter, and Weight in Euclidean Spanners
• Parallel Shortcutting of Rooted Trees
• Biased Search Trees
• Efficiency of a Good But Not Linear Set Union Algorithm
• Transitive-Closure Spanners: A Survey
• From hierarchical partitions to hierarchical covers
• Optimal euclidean spanners

This page was built for publication: Dynamic Tree Shortcut with Constant Degree