Average Update Times for Fully-Dynamic All-Pairs Shortest Paths
| Title | Average Update Times for Fully-Dynamic All-Pairs Shortest Paths |
| Publication Type | Conference Paper |
| Year of Publication | 2008 |
| Authors | Friedrich, T., & Hebbinghaus N. |
| Page(s) | 693-704 |
| Other Numbers | 2360 |
| Acknowledgment | This work was partially funded by the Deutscher Akademischer Austausch Diesnst (DAAD) through a postdoctoral fellowship. |
| URL | http://www.icsi.berkeley.edu/pubs/algorithms/2008ISAAC_APSP.pdf |
| Bibliographic Notes | Proceedings of International Symposium on Algorithms and Computation (ISAAC), Gold Coast, Australia, pp. 693-704 |
| Abbreviated Authors | T. Friedrich and N. Hebbinghaus |
| ICSI Research Group | Algorithms |
| ICSI Publication Type | Article in conference proceedings |