Fully Dynamic Graph Connectivity in Logarithmic Expected Time C.T.I. Technical Report TR 91.12.28
| Main Authors: | Reif, John H. (Author), Yung, Moti (Author), Σπυράκης, Παύλος Γ. (Author) |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Patras Greece Πάτρα Ελλάδα
Computer Technology Institute Ινστιτούτο Τεχνολογίας Υπολογιστών
1991
|
| Subjects: |
Similar Items
-
Efficient Parallel Algorithms for Shortest Paths in Planar Graphs C.T.I. Technical Report TR 91.07.21
by: Ζαρολιάγκης, Χρήστος, et al.
Published: (1991) -
Fast Reliable PRAM Emulation Faulty Butterflies C.T.I. Technical Report TR 91.12.30
by: Καπούλας, Βαγγέλης, et al.
Published: (1991) -
The Recphone [C.T.I. Technical Report] TR 91.01.4 Part of TELEMED/RACE Project
by: Βασίλογλου, Παναγιώτης, et al.
Published: (1991) -
Tight RNC approximations to Max Flow and Weighted Matching C.T.I. Technical Report TR 91.12.27
by: Serna, Maria, 1959-, et al.
Published: (1991) -
IPL: part of the TELEMED/RACE project WP4 C.T.I. Technical Report TR 91.04.12
by: Γεωργαντάς, Θεόδωρος, et al.
Published: (1991)