Optimally fast shortest path algorithms for some classes of graphs

References

• Atallah , M.J. , Chen , D.Z. and Lee , D.T. 1995 . An optimal algorithm for shortest paths on weighted interval and circular-arc graphs with applications . Algorithmica , 14 : 429 – 441 .
   Google Scholar
• Balachandran , V. and Rangan , C.P. 1996 . All-pairs-shortest-length on strongly chordal graphs . Discrete Applied Math , 69 : 169 – 182 .
   Google Scholar
• Behzad , M. , Chartrand , G. and Lesniak-Foster , L. 1979 . Graphs and Digraphs , Prindle : Weber and Schmidt .
   Google Scholar
• Cormen , T.H. , Leiserson , C.E. and Rivest , R.L. 1990 . Introduction to Algorithms , Cambridge, Massachusetts : The MIT Press .
   Google Scholar
• Dijkstra , E.W. 1959 . A note on two problems in connexion with graphs . Nwnerische.Mathematik , 1 : 269 – 271 .
   Web of Science ®Google Scholar
• Floyd , R.W. 1962 . Algorithm 97 (SHORTEST PATH) . C. ACM , 5 : 345
   Web of Science ®Google Scholar
• Frederickson , G.N. 1987 . Fast algorithms for shortest paths in planar graphs, with applications . SIAM J. Comput. , 16 : 1004 – 1022 .
   Google Scholar
• Johnson , D.B. 1977 . Efficient algorithms for shortest paths in sparse networks . J. ACM , 24 : 1 – 13 .
   Web of Science ®Google Scholar
• Lawler , E.L. 1976 . Combinatorial Optimization: Networks and Matroids , Holt : Rinehart and Winston .
   Google Scholar