• DocumentCode
    2182884
  • Title

    An all pairs shortest path algorithm with expected running time O(n 2logn)

  • Author

    Moffat, Alistair ; Takaoka, Tadao

  • fYear
    1985
  • fDate
    21-23 Oct. 1985
  • Firstpage
    101
  • Lastpage
    105
  • Abstract
    An algorithm is described that solves the all pairs shortest path problem for a nonnegatively weighted graph. The algorithm has an average requirement on quite general classes of random graphs of O(n2logn) time, where n is the number of vertices in the graph.
  • Keywords
    Algorithm design and analysis; Computer science; Cost function; Data structures; Information science; Shortest path problem; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1985., 26th Annual Symposium on
  • Conference_Location
    Portland, OR, USA
  • ISSN
    0272-5428
  • Print_ISBN
    0-8186-0644-4
  • Type

    conf

  • DOI
    10.1109/SFCS.1985.6
  • Filename
    4568133
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2182884