Skip Navigation

The Computer Journal 1993 36(6):588-592; doi:10.1093/comjnl/36.6.588
© 1993 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Khoong, C. M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Shortest-Path Reconstruction Algorithms

C. M. Khoong *

Information Technology Institute, National Computer Board, 71 Science Park Drive, Singapore 0511, Republic of Singapore

The shortest path problem in graphs is well known in computer science and operations research. This paper studies the problem of computing shortest paths between pairs of vertices in an n-vertex graph, given only the all pairs shortest paths distance matrix. This computation is called a reconstruction, since the algorithm has no access to explicit information about edges in the original graph. We present the following results:

  1. A shortest path between a single pair of vertices can be reconstructed in O(n log n) time.
  2. Shortest paths between all pairs of vertices can be reconstructed in O(n3) time.
  3. A shortest path between a single pair of vertices can be reconstructed in O((log n)2) time on an exclusive read, exclusive write parallel random access machine (EREW PRAM) with n/log n processors.
  4. Shortest path between all pairs of vertices can be reconstructed in O(n2) time on an EREW PRAM with n processors.

The significance of our results is in showing that the all pairs shortest paths distance matrix provides highly useful information on the original graph, which can be extracted very simply and efficiently. It is also hoped that this work would lead to new information theoretic insights on data structures in general.

Received July 15, 1992.

* Information Technology Institute, National Computer Board, 71 Science Park Drive, Singapore 0511, Republic of Singapore


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.