Please use this identifier to cite or link to this item:
|Title:||A lower bound for the shortest path problem|
|Publisher:||ACADEMIC PRESS INC|
|Citation:||JOURNAL OF COMPUTER AND SYSTEM SCIENCES,63(2)253-267|
|Abstract:||We show that the shortest path problem cannot be solved in o(log n) time on an unbounded fan-in PRAM without bit operations using poly(n) processors, even when the bit-lengths of the weights on the edges are restricted to be of size O(log(3) n). This shows that the matrix-based repeated squaring algorithm for the shortest path problem is optimal in the unbounded fan-in PRAM model without bit operations. (C) 2001 Academic Press.|
|Appears in Collections:||Proceedings papers|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.