Re-Randomization and Average Case Analysis of Fully Dynamic Graph Algorithms C.T.I. Technical Report TR 93.01.3
Main Authors: | Reif, John (Author), Yung, Moti (Author), Σπυράκης, Παύλος Γ. (Author) |
---|---|
Format: | Book |
Language: | English |
Published: |
Patras Greece Πάτρα Ελλάδα
Computer Technology Institute Ινστιτούτο Τεχνολογίας Υπολογιστών
1993
|
Subjects: |
Similar Items
-
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) -
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) -
Requirements for Distributed Hypermedia C.T.I. Technical Report TR 93.01.4
by: Γαβιώτης, Ιωάννης, et al.
Published: (1993) -
The Linkage of a Graph C.T.I. Technical Report TR 93.04.16
by: Θηλυκός, Δημήτρης, et al.
Published: (1993) -
Parallel Graph Decomposition Techniques with Applications to Shortest Paths Problems C.T.I. Technical Report TR 93.02.8
by: Ζαρολιάγκης, Χρήστος, et al.
Published: (1993)