李艳, 武优西, 黄春萍, 张志颖, & 曾珍香. (2015). 网树求解有向无环图中具有长度约束的最大不相交路径. 通信学报, 36(8), 38-49. https://doi.org/10.11959/j.issn.1000-436x.2015145
Chicago Style (17th ed.) Citation李艳, 武优西, 黄春萍, 张志颖, and 曾珍香. "网树求解有向无环图中具有长度约束的最大不相交路径." 通信学报 36, no. 8 (2015): 38-49. https://doi.org/10.11959/j.issn.1000-436x.2015145.
MLA (9th ed.) Citation李艳, et al. "网树求解有向无环图中具有长度约束的最大不相交路径." 通信学报, vol. 36, no. 8, 2015, pp. 38-49, https://doi.org/10.11959/j.issn.1000-436x.2015145.
Warning: These citations may not always be 100% accurate.