Treffer: Shortest-path reconstruction algorithms
Title:
Shortest-path reconstruction algorithms
Authors:
Source:
Computer journal (Print). 36(6):588-592
Publisher Information:
Oxford: Oxford University Press, 1993.
Publication Year:
1993
Physical Description:
print, 8 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Recherche information. Graphe, Information retrieval. Graph, Algorithme parallèle, Parallel algorithm, Algoritmo paralelo, Chemin plus court, Shortest path, Camino más corto, Parallélisme, Parallelism, Paralelismo, Théorie graphe, Graph theory, Teoría grafo, Algorithme séquentiel, Sequential algorithm, Problème chemin plus court, Shortest path problem
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
National computer board, information technology inst., Singapore 0511, Singapore
ISSN:
0010-4620
Rights:
Copyright 1994 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.3832479
Database:
PASCAL Archive
Weitere Informationen
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.