The Weighted All-Pairs-Shortest-Path-Length Problem on Two ...

of a Series-Parallel Graph”, Discrete Applied
Mathematics, Vol. 5, pp. 299-311, 1983.
[12] D. E. Knuth, <strong>The</strong> Art of Computer
Programming, Vol. 1, Fundamental
Algorithms, Addison-Wesley, 1968.
2
[13] P. Mirchandani, “A Simple O( n ) Algorithm
for the <strong>All</strong>-<strong>Pairs</strong> <strong>Shortest</strong> <strong>Path</strong> <strong>Problem</strong> on an
Interval Graph”, Networks, Vol. 27, pp.
215-217, 1996.
[14] S. Pettie, “A Faster <strong>All</strong>-<strong>Pairs</strong> <strong>Shortest</strong> <strong>Path</strong>
Algorithm for Real-<strong>Weighted</strong> Sparse Graphs”,
Lecture Notes in Computer Science, Vol. 2380,
pp. 85-97, 2002.
[15] R. Ravi, M. V. Marathe, and C. P. Rangan, “An
Optimal Algorithm to Solve the <strong>All</strong>-Pair
<strong>Shortest</strong> <strong>Path</strong> <strong>Problem</strong> on Interval Graphs”,
Networks, Vol. 22, pp. 21-35, 1992.
[16] K. Takamizwa, T. Nishizeki, and N. Saito,
“Linear-Time Computability of
Combinatorial <strong>Problem</strong>s on Series-Parallel
Graphs”, Journal of the A.C.M., Vol. 29, No.
3, pp. 623-641, 1982.
3
[17] T. Takaoka, “An O( n loglogn / logn) Time
Algorithm for the <strong>All</strong>-<strong>Pairs</strong> <strong>Shortest</strong> <strong>Path</strong>
<strong>Problem</strong>”, Information Processing Letters.,
Vol. 96, pp. 155-161, 2005.
[18] M. Thorup, “Undirected Single-Source
<strong>Shortest</strong> <strong>Path</strong>s with Positive Integer Weights in
Linear Time, Journal of the ACM, Vol. 1l, No.
1, 1999.
[19] C-KYen and C-Y Tang, A Study on the
Searchlight Guarding <strong>Problem</strong>, Ph.D.
Dissertation, Department of Computer
Science, National Tsing Hua University,
1996.
<strong>The</strong> 25th Workshop on Combinatorial Mathematics and Computation <strong>The</strong>ory
-361-