On Finding and Updating Spanning Trees and Shortest Paths
From MaRDI portal
Publication:4088854
DOI10.1137/0204032zbMath0325.05119OpenAlexW2071845176WikidataQ56077959 ScholiaQ56077959MaRDI QIDQ4088854
No author found.
Publication date: 1975
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0204032
Related Items (27)
An O(log n) algorithm for parallel update of minimum spanning trees ⋮ A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges ⋮ Optimal parallel algorithms for multiple updates of minimum spanning trees ⋮ A new approach to all-pairs shortest paths on real-weighted graphs ⋮ Dynamic expression trees ⋮ On the computational complexity of dynamic graph problems ⋮ A robust and scalable algorithm for the Steiner problem in graphs ⋮ An efficient parallel algorithm for updating minimum spanning trees ⋮ A new approach for the multiobjective minimum spanning tree ⋮ A reoptimization algorithm for the shortest path problem with time windows ⋮ Optimal algorithms for sensitivity analysis in associative multiplication problems ⋮ Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem ⋮ Discrete extremal problems ⋮ Unnamed Item ⋮ Incremental Network Design with Minimum Spanning Trees ⋮ Solving group Steiner problems as Steiner problems. ⋮ Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time ⋮ An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem ⋮ Associative parallel algorithm for dynamic update of a minimum spanning tree after addition of a new node to a graph ⋮ Algorithms for updating minimal spanning trees ⋮ On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs ⋮ Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree ⋮ Matroid optimization with the interleaving of two ordered sets ⋮ Sensitivity analysis of the economic lot-sizing problem ⋮ The lower bounds on distributed shortest paths ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis ⋮ Lifelong planning \(\text{A}^*\)
This page was built for publication: On Finding and Updating Spanning Trees and Shortest Paths
