• DocumentCode
    527619
  • Title

    An improved algorithm for vertex sequence of shortest path

  • Author

    Fu Bai-wen

  • Author_Institution
    Dept. of Software Eng., Beijing Union Univ., Beijing, China
  • Volume
    1
  • fYear
    2010
  • fDate
    10-12 Aug. 2010
  • Firstpage
    112
  • Lastpage
    116
  • Abstract
    It´s important to evaluate the shortest paths in many fields. Based on one-dimension arrays an improved algorithm for vertex sequence of shortest path in undirected networks is given. An illumination rule is presented for improving the algorithm efficiency. Both of time and space efficiency can be improved on the rule. Analysis about the algorithm is presented. Experiments have been done for showing the efficiency of the algorithm.
  • Keywords
    computational complexity; graph theory; illumination rule; one-dimension arrays; shortest path; space efficiency; time efficiency; undirected networks; vertex sequence; Algorithm design and analysis; Computers; Heuristic algorithms; Indexes; Lighting; Partitioning algorithms; Software algorithms; algorithm; shortest path; undirected network; vertex sequence;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Natural Computation (ICNC), 2010 Sixth International Conference on
  • Conference_Location
    Yantai, Shandong
  • Print_ISBN
    978-1-4244-5958-2
  • Type

    conf

  • DOI
    10.1109/ICNC.2010.5583353
  • Filename
    5583353
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=527619