An all pairs shortest path algorithm taking O(n2.(loglog n)) time on the anerage. [C.T.I. Technical Reports] TR 88.05.53
| Main Authors: | Σπυράκης, Παύλος Γ. (Author), Τσακαλίδης, Αθανάσιος (Author) |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Patras Greece Πάτρα Ελλάδα
Computer Technology Institute Ινστιτούτο Τεχνολογίας Υπολογιστών
1988 1988
|
| Subjects: |
Similar Items
-
An all pairs shortest path algorithm taking 0(n2(loglogn)k) time on the average. [C.T.I. Technical Reports] TR 88.03.47
by: Σπυράκης, Παύλος Γ., et al.
Published: (1988) -
Efficient Symmetry Breaking in Archimedean and Asynchronous Rings [C.T.I. Technical Reports] TR 88.05.54
by: Σπυράκης, Παύλος Γ., et al.
Published: (1988) -
Το Πρόβλημα του Εντοπισμού Σημείου στο Επίπεδο [Τεχνική Αναφορά ΙΤΥ] TR 88.09.61
by: Δαβαράκης, Κ., et al.
Published: (1988) -
Computational and Performance Aspects of Program Localities [C.T.I. Technical Reports] TR 88.09.62
by: Γαροφαλάκης, Γιάννης, et al.
Published: (1988) -
Pragmatic Computational Geometry algorithms, raising the issues. Technical Report No 5 a SED project Task-4 release [C.T.I. Technical Reports] TR 88.02.46
by: Δαβαράκης, Χ., et al.
Published: (1988)