Reif, J. H., Yung, M., & Σπυράκης, Π. Γ. (1991). Fully Dynamic Graph Connectivity in Logarithmic Expected Time C.T.I. Technical Report TR 91.12.28. Computer Technology Institute Ινστιτούτο Τεχνολογίας Υπολογιστών.
Chicago Style (17th ed.) CitationReif, John H., Moti Yung, and Παύλος Γ Σπυράκης. Fully Dynamic Graph Connectivity in Logarithmic Expected Time C.T.I. Technical Report TR 91.12.28. Patras Greece Πάτρα Ελλάδα: Computer Technology Institute Ινστιτούτο Τεχνολογίας Υπολογιστών, 1991.
MLA (8th ed.) CitationReif, John H., et al. Fully Dynamic Graph Connectivity in Logarithmic Expected Time C.T.I. Technical Report TR 91.12.28. Computer Technology Institute Ινστιτούτο Τεχνολογίας Υπολογιστών, 1991.
Warning: These citations may not always be 100% accurate.