Dynamic tree shortcut with constant degree

DOI10.1007/978-3-319-21398-9_34zbMATH Open1465.68210OpenAlexW2240773382MaRDI QIDQ3196404FDOQ3196404

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

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

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)

Cites Work

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

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)