Snoeyink, J. (2007). Maximum independent set for intervals by divide and conquer with pruning. Networks, 49(2), 158-159. https://doi.org/10.1002/net.20150
Citácia podle Chicago (17th ed.)Snoeyink, Jack. "Maximum Independent Set for Intervals by Divide and Conquer with Pruning." Networks 49, no. 2 (2007): 158-159. https://doi.org/10.1002/net.20150.
Citácia podľa MLA (8th ed.)Snoeyink, Jack. "Maximum Independent Set for Intervals by Divide and Conquer with Pruning." Networks, vol. 49, no. 2, 2007, pp. 158-159, https://doi.org/10.1002/net.20150.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..