Brause, C. (2017). A subexponential-time algorithm for the Maximum Independent Set Problem in Pt-free graphs. Discrete Applied Mathematics, 231, 113-118. https://doi.org/10.1016/j.dam.2016.06.016
Citácia podle Chicago (17th ed.)Brause, Christoph. "A Subexponential-time Algorithm for the Maximum Independent Set Problem in Pt-free Graphs." Discrete Applied Mathematics 231 (2017): 113-118. https://doi.org/10.1016/j.dam.2016.06.016.
Citácia podľa MLA (8th ed.)Brause, Christoph. "A Subexponential-time Algorithm for the Maximum Independent Set Problem in Pt-free Graphs." Discrete Applied Mathematics, vol. 231, 2017, pp. 113-118, https://doi.org/10.1016/j.dam.2016.06.016.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..