Self-adjusting top trees

MaRDI QIDQ2921745zbMATH OpenFDO

Authors Renato F. Werneck, Robert E. Tarjan

Publication date 13 October 2014

Mathematics Subject Classification ID

Trees (05C05) Data structures (68P05)

Recommendations

• Dynamic trees in practice
• Maintaining information in fully dynamic trees with top trees
• Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
• A Data Structure for Dynamically Maintaining Rooted Trees
• scientific article; zbMATH DE number 437542

Cited in

(19)

• Bottom-up tree acceptors
• Dynamically optimal self-adjusting single-source tree networks
• A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph
• Maintaining information in fully dynamic trees with top trees
• Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
• Categorified Reeb graphs
• scientific article; zbMATH DE number 437542 (Why is no real title available?)
• Dynamic tree shortcut with constant degree
• A Data Structure for Dynamically Maintaining Rooted Trees
• LS(graph): a constraint-based local search for constraint optimization on trees and paths
• Topology B-trees and their applications
• Batch-parallel Euler tour trees
• Dynamic trees in practice
• Power balance and apportionment algorithms for the United States Congress
• Dynamizing static algorithms, with applications to dynamic trees and history independence
• Algorithms and Computation
• scientific article; zbMATH DE number 7651141 (Why is no real title available?)
• Fast and simple unrooted dynamic forests
• Fault-tolerant ST-diameter oracles

This page was built for publication: Self-adjusting top trees

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