An all pairs shortest path algorithm taking 0(n2(loglogn)k) time on the average. [C.T.I. Technical Reports] TR 88.03.47
| 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 O(n2.(loglog n)) time on the anerage. [C.T.I. Technical Reports] TR 88.05.53
by: Σπυράκης, Παύλος Γ., et al.
Published: (1988) -
Transaction Synchronisation in Object Bases [C.T.I. Technical Reports] TR 88.03.49
by: Χατζηλάκος, Θανάσης, et al.
Published: (1988) -
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) -
Serialization Graph Algorithms for Multiversion Concurrency Control C.T.I. [Technical Reports] TR 88.03.48
by: Χατζηλάκος, Θανάσης
Published: (1988) -
Το Πρόβλημα του Εντοπισμού Σημείου στο Επίπεδο [Τεχνική Αναφορά ΙΤΥ] TR 88.09.61
by: Δαβαράκης, Κ., et al.
Published: (1988)