A data structure for dynamic trees

1983/06/01 by Daniel D. Sleator, Robert E. Tarjan, Robert Endre Tarjan · 7 citations
Computer Science · Engineering · Mathematics · #Algorithm #Algorithms and Data Compression #Combinatorics #Computer science #Data structure #Disjoint sets #Enhanced Data Rates for GSM Evolution #Flow network #Graph #Interconnection Networks and Systems #Mathematics #Maximum flow problem #Sequence (biology) #Simplex #Theoretical computer science #Tree (set theory) #VLSI and FPGA Design Techniques #Vertex (graph theory)

paper · doi:10.1016/0022-0000(83)90006-5

crossref issued 1983/06/01 · crossref published 1983/06/01 · crossref published-print 1983/06/01 · openalex publication_date 1983/06/01 · crossref created 2003/12/04 · crossref deposited 2019/02/16 · openalex created_date 2025/10/10 · crossref indexed 2026/07/15 · openalex updated_date 2026/07/23

Citations

• Fast Algorithms for Finding Nearest Common Ancestors
• Applications of Path Compression on Balanced Trees

Cited by

• Maintaining bridge-connected and biconnected components on-line
• A Faster Deterministic Maximum Flow Algorithm
• Beyond the flow decomposition barrier
• Network flow and 2-satisfiability
• Forests, frames, and games: Algorithms for matroid sums and applications
• Computing the Girth of a Planar Graph in Linear Time
• Maximum flow problem [wikipedia]