• DocumentCode
    1710750
  • Title

    Planar graphs, negative weight edges, shortest paths, and near linear time

  • Author

    Fakcharoenphol, Jittat ; Rao, Satish

  • Author_Institution
    Comput. Sci. Div., California Univ., Berkeley, CA, USA
  • fYear
    2001
  • Firstpage
    232
  • Lastpage
    241
  • Abstract
    The authors present an O(n log3 n) time algorithm for finding shortest paths in a planar graph with real weights. This can be compared to the best previous strongly polynomial time algorithm developed by R. Lipton et al., (1978 )which ran in O(n32/) time, and the best polynomial algorithm developed by M. Henzinger et al. (1994) which ran in O˜(n43/) time. We also present significantly improved algorithms for query and dynamic versions of the shortest path problems.
  • Keywords
    computational complexity; graph theory; optimisation; best previous strongly polynomial time algorithm; dynamic versions; near linear time; negative weight edges; planar graphs; query versions; real weights; shortest path problems; Bipartite graph; Computer science; Image segmentation; Particle separators; Partitioning algorithms; Polynomials; Radio access networks; Scholarships; Shortest path problem; Tree graphs;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on
  • Print_ISBN
    0-7695-1116-3
  • Type

    conf

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