Bhushan, A., & Sajith, G. (2015). I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs. Theoretical computer science, 575, 33-41. https://doi.org/10.1016/j.tcs.2014.10.043
Citácia podle Chicago (17th ed.)Bhushan, Alka, a G. Sajith. "I/O Efficient Algorithms for the Minimum Cut Problem on Unweighted Undirected Graphs." Theoretical Computer Science 575 (2015): 33-41. https://doi.org/10.1016/j.tcs.2014.10.043.
Citácia podľa MLA (8th ed.)Bhushan, Alka, a G. Sajith. "I/O Efficient Algorithms for the Minimum Cut Problem on Unweighted Undirected Graphs." Theoretical Computer Science, vol. 575, 2015, pp. 33-41, https://doi.org/10.1016/j.tcs.2014.10.043.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..