DSpace
 

DSpace at IIT Bombay >
IITB Publications >
Proceedings papers >

Please use this identifier to cite or link to this item: http://dspace.library.iitb.ac.in/jspui/handle/100/1235

Title: A lower bound for the shortest path problem
Authors: MULMULEY, K
SHAH, P
Issue Date: 2001
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.
URI: http://dx.doi.org/10.1006/jcss.2001.1766
http://dspace.library.iitb.ac.in/xmlui/handle/10054/14424
http://hdl.handle.net/100/1235
ISSN: 0022-0000
Appears in Collections:Proceedings papers

Files in This Item:

There are no files associated with this item.

View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback