A Data Structure for Dynamically Maintaining Rooted Trees

DOI10.1006/JAGM.1996.0835MaRDI QIDQ4349698zbMATH OpenOpenAlexFDO

Authors Greg N. Frederickson

Publication date 25 August 1997

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1986&context=cstech

zbMATH Keywords

directed topology tree data structure

Mathematics Subject Classification ID

Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 437542
• Dynamic trees in practice
• Self-adjusting top trees
• Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
• Maintaining regular properties dynamically in k-terminal graphs

Cited in

(21)

• Dynamic path queries in linear space
• Succinct indices for path minimum, with applications
• Self-adjusting top trees
• Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
• Union-copy structures and dynamic segment trees
• scientific article; zbMATH DE number 437542 (Why is no real title available?)
• Data structures for mergeable trees
• Dynamic tree shortcut with constant degree
• scientific article; zbMATH DE number 4011953 (Why is no real title available?)
• LS(graph): a constraint-based local search for constraint optimization on trees and paths
• Topology B-trees and their applications
• A consistent semantics of self-adjusting computation
• 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
• Incremental dead state detection in logarithmic time
• Fast and simple unrooted dynamic forests
• Maintaining \(\mathrm{CMSO}_2\) properties on dynamic structures with bounded feedback vertex number
• \(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges
• Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies

This page was built for publication: A Data Structure for Dynamically Maintaining Rooted Trees

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