• DocumentCode
    588935
  • Title

    An Improved Dijkstra Algorithm Based on Pairing Heap

  • Author

    Wei Zhang ; Chong Jiang ; Yunxiang Ma

  • Author_Institution
    Coll. of Inf. Eng., Beijing Inst. of Petrochem. Technol., Beijing, China
  • Volume
    2
  • fYear
    2012
  • fDate
    28-29 Oct. 2012
  • Firstpage
    419
  • Lastpage
    422
  • Abstract
    In this paper, we presented a method for shortest path computation process using Dijkstra algorithm based on Pairing heap. We compared the methods by the Pairing heap method and Fibonacci heap method. with experiment", "we could see that the method by Pairing heap have more efficiency than by Fibonacci heap.
  • Keywords
    graph theory; search problems; Fibonacci heap method; improved Dijkstra algorithm; pairing heap; shortest path computation process; Computational intelligence; Dijkstra algorithm; GIS; Network Analysis; shortest path algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Intelligence and Design (ISCID), 2012 Fifth International Symposium on
  • Conference_Location
    Hangzhou
  • Print_ISBN
    978-1-4673-2646-9
  • Type

    conf

  • DOI
    10.1109/ISCID.2012.260
  • Filename
    6406028
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=588935