scientific article; zbMATH DE number 7651141

DOI10.4230/LIPICS.ESA.2020.2MaRDI QIDQ5874462zbMATH OpenFDO

Authors

Publication date 7 February 2023

Full work available at URL https://arxiv.org/abs/2002.05129

zbMATH Keywords

graph algorithmsparallel algorithmsdynamic algorithmsdynamic trees

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 1003260 (Why is no real title available?)
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• A data structure for dynamic trees
• Adaptive functional programming
• Batch-parallel Euler tour trees
• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
• Dynamizing static algorithms, with applications to dynamic trees and history independence
• Maintaining information in fully dynamic trees with top trees
• Minimum cuts in near-linear time
• On parallel hashing and integer sorting
• Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds
• Parallel Tree Contraction Part 2: Further Applications
• Randomized fully dynamic graph algorithms with polylogarithmic time per operation
• Self-adjusting top trees
• Work-efficient parallel union-find with applications to incremental graph connectivity

This page was built for publication:

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