Fully dynamic all pairs shortest paths with real edge weights

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 260-267

  Demetrescu, C ^a   Italiano, G F ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ERROR ANALYSIS; PROBLEM SOLVING; SET THEORY;

SHORTEST PATH PROBLEMS;

GRAPH THEORY;

EID: 0035176167     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.2001.959900     Document Type: Conference Paper

References (25)

1. On the exponent of the all pairs shortest path problem
2. Incremental algorithms for minimal length paths
3. Matrix multiplication via arithmetic progressions
4. 2) barrier
5. Updating distances in dynamic graphs
6. New bounds on the complexity of the shortest path problems
7. Fibonacci heaps and their use in improved network optimization algorithms
8. Semi-dynamic algorithms for maintaining single source shortest paths trees
9. Fully dynamic algorithms for maintaining shortest paths trees
10. All pairs shortest distances for graphs with small integer length edges
11. All pairs shortest paths for graphs with small integer length edges
12. Faster shortest-path algorithms for planar graphs
13. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs
14. A network evaluation procedure
15. An incremental algorithm for a generalization of the shortest path problem
16. On the computational complexity of dynamic graph problems
17. The parametric problem of shortest distances
18. A dynamization of the all-pairs least cost problem
19. On the all-pairs-shortest-path problem in unweighted undirected graphs
20. All pairs shortest paths in undirected graphs with integer weights
21. A new upper bound on the complexity of the all pairs shortest path problem
22. All pairs shortest paths in weighted directed graphs - Exact and almost exact algorithms