Cite
A branch and bound irredundant graph algorithm for large-scale MLCS problems.
MLA
Wang, Chunyang, et al. “A Branch and Bound Irredundant Graph Algorithm for Large-Scale MLCS Problems.” Pattern Recognition, vol. 119, Nov. 2021, p. N.PAG. EBSCOhost, https://doi.org/10.1016/j.patcog.2021.108059.
APA
Wang, C., Wang, Y., & Cheung, Y. (2021). A branch and bound irredundant graph algorithm for large-scale MLCS problems. Pattern Recognition, 119, N.PAG. https://doi.org/10.1016/j.patcog.2021.108059
Chicago
Wang, Chunyang, Yuping Wang, and Yiuming Cheung. 2021. “A Branch and Bound Irredundant Graph Algorithm for Large-Scale MLCS Problems.” Pattern Recognition 119 (November): N.PAG. doi:10.1016/j.patcog.2021.108059.