Cite
An exact algorithm for maximum independent set in degree-5 graphs.
MLA
Xiao, Mingyu, and Hiroshi Nagamochi. “An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs.” Discrete Applied Mathematics, vol. 199, Jan. 2016, pp. 137–55. EBSCOhost, https://doi.org/10.1016/j.dam.2014.07.009.
APA
Xiao, M., & Nagamochi, H. (2016). An exact algorithm for maximum independent set in degree-5 graphs. Discrete Applied Mathematics, 199, 137–155. https://doi.org/10.1016/j.dam.2014.07.009
Chicago
Xiao, Mingyu, and Hiroshi Nagamochi. 2016. “An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs.” Discrete Applied Mathematics 199 (January): 137–55. doi:10.1016/j.dam.2014.07.009.