Citace podle APA (7th ed.)

Okamoto, Y., Otachi, Y., Uehara, R., & Uno, T. (2011). Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. Journal of graph algorithms and applications, 15(6), 727-751. https://doi.org/10.7155/jgaa.00246

Citace podle Chicago (17th ed.)

Okamoto, Yoshio, Yota Otachi, Ryuhei Uehara, a Takeaki Uno. "Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem." Journal of Graph Algorithms and Applications 15, no. 6 (2011): 727-751. https://doi.org/10.7155/jgaa.00246.

Citace podle MLA (9th ed.)

Okamoto, Yoshio, et al. "Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem." Journal of Graph Algorithms and Applications, vol. 15, no. 6, 2011, pp. 727-751, https://doi.org/10.7155/jgaa.00246.

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