Cite
Optimal Path and Minimal Spanning Trees in Random Weighted Networks
MLA
Tomer Kalisky, et al. Optimal Path and Minimal Spanning Trees in Random Weighted Networks. June 2006. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsair&AN=edsair.doi.dedup.....164036482139b29c67f4f738ebe72731&authtype=sso&custid=ns315887.
APA
Tomer Kalisky, Sameet Sreenivasan, Shlomo Havlin, Lidia A. Braunstein, Sergey V. Buldyrev, Eduardo López, Reuven Cohen, H. E. Stanley, Y. Chen, & Zhenhua Wu. (2006). Optimal Path and Minimal Spanning Trees in Random Weighted Networks.
Chicago
Tomer Kalisky, Sameet Sreenivasan, Shlomo Havlin, Lidia A. Braunstein, Sergey V. Buldyrev, Eduardo López, Reuven Cohen, H. E. Stanley, Y. Chen, and Zhenhua Wu. 2006. “Optimal Path and Minimal Spanning Trees in Random Weighted Networks,” June. http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsair&AN=edsair.doi.dedup.....164036482139b29c67f4f738ebe72731&authtype=sso&custid=ns315887.