Estimating all pairs shortest paths in restricted graph families: a unified approach

MLA

Feodor F. Dragan. “Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach.” Journal of Algorithms, vol. 57, Sept. 2005, pp. 1–21. 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...........5137cd57b0d5ed3d1eb3b425127a7ef4&authtype=sso&custid=ns315887.

APA

Feodor F. Dragan. (2005). Estimating all pairs shortest paths in restricted graph families: a unified approach. Journal of Algorithms, 57, 1–21.

Chicago

Feodor F. Dragan. 2005. “Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach.” Journal of Algorithms 57 (September): 1–21. 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...........5137cd57b0d5ed3d1eb3b425127a7ef4&authtype=sso&custid=ns315887.