De, M., Nandy, S. C., & Roy, S. (2014). In-place algorithms for computing a largest clique in geometric intersection graphs. Discrete Applied Mathematics, 178, 58-70. https://doi.org/10.1016/j.dam.2014.06.025
Citácia podle Chicago (17th ed.)De, Minati, Subhas C. Nandy, a Sasanka Roy. "In-place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs." Discrete Applied Mathematics 178 (2014): 58-70. https://doi.org/10.1016/j.dam.2014.06.025.
Citácia podľa MLA (8th ed.)De, Minati, et al. "In-place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs." Discrete Applied Mathematics, vol. 178, 2014, pp. 58-70, https://doi.org/10.1016/j.dam.2014.06.025.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..