Fast and simple unrooted dynamic forests

DOI10.1137/1.9781611977929.4MaRDI QIDQ6545383zbMATH OpenFDO

Authors Benjamin Aram Berendsohn

Publication date 29 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977929.4

Mathematics Subject Classification ID

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

Recommendations

• Dynamic trees in practice
• A Data Structure for Dynamically Maintaining Rooted Trees
• scientific article; zbMATH DE number 437542
• Self-adjusting top trees
• Path Minima in Incremental Unrooted Trees

This page was built for publication: Fast and simple unrooted dynamic forests

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