Efficient Parallel Algorithms for Shortest Paths in Planar Graphs C.T.I. Technical Report TR 91.07.21
Main Authors: | Ζαρολιάγκης, Χρήστος (Author), Πάντζιου, Γραμματή (Author), Σπυράκης, Παύλος Γ. (Author) |
---|---|
Format: | Book |
Language: | English |
Published: |
Patras Greece Patras Greece New York USA Πάτρα Ελλάδα
Computer Technology Institute Computer Science and Engineering Department, Patras University Courant Institute of Mathematical Sciences, U.S.A. Ινστιτούτο Τεχνολογίας Υπολογιστών
1991
|
Subjects: |
Similar Items
-
An all pairs shortest algorithm taking 0 (n2 logn/loglogn) time on the average [C.T.I. Technical Report] TR 91.01.2
by: Σπυράκης, Παύλος Γ., et al.
Published: (1991) -
A Conceptual Schema for Geographic Databases C.T.I. Technical Report TR 91.03.07
by: Τρύφωνα, Νεκταρία, et al.
Published: (1991) -
Fully Dynamic Graph Connectivity in Logarithmic Expected Time C.T.I. Technical Report TR 91.12.28
by: Reif, John H., et al.
Published: (1991) -
The Recphone [C.T.I. Technical Report] TR 91.01.4 Part of TELEMED/RACE Project
by: Βασίλογλου, Παναγιώτης, et al.
Published: (1991) -
Efficient Parallel Algorithms for Shortest Paths in Planar Graphs C.T.I. Technical Report TR. 90.01.02
by: Πάντζιου, Γραμματή, et al.
Published: (1990)