APA (7th ed.) Citation

Nobili, P., & Sassano, A. (2021). An O(n2logn) algorithm for the weighted stable set problem in claw-free graphs. Mathematical programming, 186(1-2), 409-437. https://doi.org/10.1007/s10107-019-01461-5

Chicago Style (17th ed.) Citation

Nobili, Paolo, and Antonio Sassano. "An O(n2logn) Algorithm for the Weighted Stable Set Problem in Claw-free Graphs." Mathematical Programming 186, no. 1-2 (2021): 409-437. https://doi.org/10.1007/s10107-019-01461-5.

MLA (9th ed.) Citation

Nobili, Paolo, and Antonio Sassano. "An O(n2logn) Algorithm for the Weighted Stable Set Problem in Claw-free Graphs." Mathematical Programming, vol. 186, no. 1-2, 2021, pp. 409-437, https://doi.org/10.1007/s10107-019-01461-5.