Data Structures and Network Algorithms

1983/01/01 by Robert E. Tarjan · 12 citations
Computer Science · #Advanced Database Systems and Queries #Algorithm #Algorithms and Data Compression #Computer science #Data Mining Algorithms and Applications

paper · doi:10.1137/1.9781611970265

openalex publication_date 1983/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

Foundations Disjoint Sets Heaps Search Trees Linking and Cutting Trees Minimum Spanning Trees Shortest Paths Network Flows Matchings.

Cited by

• Faster scaling algorithms for general graph matching problems
• GraphDC: A Divide-and-Conquer Multi-Agent System for Scalable Graph Algorithm Reasoning
• Relative neighborhood graphs and their relatives
• Theory of minimum spanning trees. II. Exact graphical methods and perturbation expansion at the percolation threshold
• Planar minimally rigid graphs and pseudo-triangulations
• Algorithms for drawing graphs: an annotated bibliography
• A Stronger Lower Bound on Parametric Minimum Spanning Trees
• Finding Dominators via Disjoint Set Union
• Low-energy excitations in the three-dimensional random-field Ising model
• Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model
• Shortest paths algorithms: Theory and experimental evaluation
• Hopcroft–Karp algorithm [wikipedia]