By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fakcharoenphol, J. ; Comput. Sci. Div., California Univ., Berkeley, CA, USA ; Rao, S.

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.

Published in:

Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on

Date of Conference:

8-11 Oct. 2001