Highly Influenced

# Shortest Path Tree Computation in Dynamic Graphs

@article{Chan2009ShortestPT, title={Shortest Path Tree Computation in Dynamic Graphs}, author={Edward P. F. Chan and Yaya Yang}, journal={IEEE Transactions on Computers}, year={2009}, volume={58}, pages={541-557} }

- Published 2009 in IEEE Transactions on Computers
DOI:10.1109/TC.2008.198

Let G = (V, E, omega) be a simple digraph, in which all edge weights are nonnegative real numbers. Let G' be obtained from G by an application of a set of edge weight updates to G. Let sisinV and let Ts and Ts' be Shortest Path Trees (SPTs) rooted at s in G and G', respectively. The Dynamic Shortest Path (DSP) problem is to compute Ts' from Ts. Existing work on this problem focuses on either a single edge weight change or multiple edge weight changes in which some of them are incorrect or are… CONTINUE READING

Highly Cited

This paper has 47 citations. REVIEW CITATIONS

#### From This Paper

##### Figures, tables, and topics from this paper.

26 Citations

19 References

Similar Papers