Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing. C.T.I. [Technical Report] TR. 93.11.41
| Main Authors: | Palem, K. (Author), Yung, M. (Author), Νικολετσέας, Σωτήρης (Author), Σπυράκης, Παύλος Γ. (Author) |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Patra Greece
Computer Technology Institute
c1993
|
| Subjects: |
Similar Items
-
Re-Randomization and Average Case Analysis of Fully Dynamic Graph Algorithms C.T.I. Technical Report TR 93.01.3
by: Reif, John, 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) -
A randomised algorithm for all pairs shortest paths in 0( ) expected time C.T.I. Technical Report TR 93.07.27
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) -
Why Mick Doesn't Get Any: Thresholds for (Un)Satisfiability C.T.I. Technical Report TR 93.12.42
by: Kamath, Anil, et al.
Published: (1993)