On Finding and Updating Spanning Trees and Shortest Paths
From MaRDI portal
Publication:4088854
DOI10.1137/0204032zbMath0325.05119WikidataQ56077959 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
A comprehensive simplex-like algorithm for network optimization and perturbation analysis, An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem, Sensitivity analysis of the economic lot-sizing problem, The lower bounds on distributed shortest paths, Dynamic expression trees, On the computational complexity of dynamic graph problems, Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree, Optimal parallel algorithms for multiple updates of minimum spanning trees