An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
Tóm tắt
We give the first linear-time algorithm for computing single-source shortest paths in a weighted interval or circular-arc graph, when we are given the model of that graph, i.e., the actual weighted intervals or circular-arcsand the sorted list of the interval endpoints. Our algorithm solves this problem optimally inO(n) time, wheren is the number of intervals or circular-arcs in a graph. An immediate consequence of our result is anO(qn + n logn)-time algorithm for the minimum-weight circle-cover problem, whereq is the minimum number of arcs crossing any point on the circle; then logn term in this time complexity is from a preprocessing sorting step when the sorted list of endpoints is not given as part of the input. The previously best time bounds were0(n logn) for this shortest paths problem, andO(qn logn) for the minimum-weight circle-cover problem. Thus we improve the bounds of both problems. More importantly, the techniques we give hold the promise of achieving similar (logn)-factor improvements in other problems on such graphs.
Tài liệu tham khảo
A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
M. J. Atallah and D. Z. Chen, An optimal parallel algorithm for the minimum circle-cover problem,Information Processing Letters,32, 1989, 159–165.
A. A. Bertossi, Parallel circle-cover algorithms,Information Processing Letters,27, 1988, 133–139.
K. S. Booth and G. S. Luekher, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms,Journal of Computer and System Sciences,13, 1976, 335–379.
D. Z. Chen and D. T. Lee, solving the all-pair shortest path problem on interval and circular-arc graphs,Proceedings of the 8thtInternational Parallel Processing Symposium, Cancun, Mexico, April 1994, pp. 224–228.
H. N. Gabow and R. E. Tarjan, A linear-time algorithm for a special case of disjoint set union,Journal of Computer and System Sciences,30, 1985, 209–221.
M. C. Golumbic,Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
U. I. Gupta, D. T. Lee, and J. Y.-T. Leung, Efficient algorithms for interval graphs and circular-arc graphs,Networks,12, 1982, 459–467.
O. H. Ibarra, H. Wang, and Q. Zheng, Minimum cover and single source shortest path problems for weighted interval graphs and circular-arc graphs,Proceedings of the 30th Annual Allerton Conference on Communication, Control, and Computing, 1992, University of Illinois, Urbana, pp. 575–584.
C. C. Lee and D. T. Lee, On a circle-cover minimization problem,Information Processing Letters,18, 1984, 109–115.
R. Ravi, M. V. Marathe, and C. P. Rangan, An optimal algorithm to solve the all-pair shortest path problem on interval graphs,Networks,22, 1992, 21–35.
M. Sarrafzadeh and D. T. Lee, Restricted track assignment with applications,International Journal of Computational Geometry & Applications,4(1), March 1994, 53–68.
R. E. Tarjan, A class of algorithms which require nonlinear time to maintain disjoint sets,Journal of Computer and System Sciences,18(2), 1979, 110–127.
P. Van Emde Boas, Preserving order in a forest in less than logarithmic time and linear space,Information Processing Letters,6(3), 1977, 80–82.