Dynamic tree shortcut with constant degree

DOI10.1007/978-3-319-21398-9_34MaRDI QIDQ3196404zbMATH OpenOpenAlexFDO

Authors

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

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

Recommendations

• Succinct data structure for dynamic trees with faster queries
• A near-optimal algorithm for finding an optimal shortcut of a tree
• Self-adjusting top trees
• A Data Structure for Dynamically Maintaining Rooted Trees
• scientific article; zbMATH DE number 437542

Cites work

• scientific article; zbMATH DE number 512931 (Why is no real title available?)
• scientific article; zbMATH DE number 720183 (Why is no real title available?)
• scientific article; zbMATH DE number 2079397 (Why is no real title available?)
• A data structure for dynamic trees
• Biased Search Trees
• Biased skip lists
• Computing on a free tree via complexity-preserving mappings
• Efficiency of a Good But Not Linear Set Union Algorithm
• From hierarchical partitions to hierarchical covers: optimal fault-tolerant spanners for doubling metrics
• Optimal Euclidean spanners, really short, thin and lanky
• Parallel Shortcutting of Rooted Trees
• Transitive-closure spanners: a survey

This page was built for publication: Dynamic tree shortcut with constant degree

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