A randomised algorithm for all pairs shortest paths in 0( ) expected time C.T.I. Technical Report TR 93.07.27
| Main Authors: | Νικολετσέας, Σωτήρης (Author), Σπυράκης, Παύλος Γ. (Author) |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Patras Greece Patras Greece Πάτρα Ελλάδα
Computer Technology Institute Computer Science and Engineering Department, Patras University Ινστιτούτο Τεχνολογίας Υπολογιστών
1993
|
| Subjects: |
Similar Items
-
Parallel Graph Decomposition Techniques with Applications to Shortest Paths Problems C.T.I. Technical Report TR 93.02.8
by: Ζαρολιάγκης, Χρήστος, et al.
Published: (1993) -
Near-Optimal Dominating Sets in Dense Random Graphs in Polynomial Expected Time C.T.I. Technical Report TR 93.03.13
by: Νικολετσέας, Σωτήρης, et al.
Published: (1993) -
Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing. C.T.I. [Technical Report] TR. 93.11.41
by: Palem, K., et al.
Published: (1993) -
Hammock-on-Ears Decomposition: A Technique for Parallel and On-line Path Problems C.T.I. Technical Report TR 93.05.22
by: Ζαρολιάγκης, Χρήστος, et al.
Published: (1993) -
Υλοποίηση του επεξεργαστή σχεδιασμού απαιτήσεων σε υλικά Ι.Τ.Υ. Τεχνική Αναφορά TR 93.07.29
by: Θηλυκός, Δημήτρης, et al.
Published: (1993)