Citace podle APA (7th ed.)

Chitnis, R., Esfandiari, H., Hajiaghayi, M., Khandekar, R., Kortsarz, G., & Seddighin, S. (2017). A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands. Algorithmica, 77(4), 1216-1239. https://doi.org/10.1007/s00453-016-0145-8

Citace podle Chicago (17th ed.)

Chitnis, Rajesh, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, a Saeed Seddighin. "A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands." Algorithmica 77, no. 4 (2017): 1216-1239. https://doi.org/10.1007/s00453-016-0145-8.

Citace podle MLA (9th ed.)

Chitnis, Rajesh, et al. "A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands." Algorithmica, vol. 77, no. 4, 2017, pp. 1216-1239, https://doi.org/10.1007/s00453-016-0145-8.

Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..