Xingfu Li, Haodi Feng, Haotao Jiang, Binhai Zhu. Solving the maximum internal spanning tree problem on interval graphs in polynomial time. Theoretical Computer Science, 734:32-37, 2018. [doi]
@article{LiFJZ18,
title = {Solving the maximum internal spanning tree problem on interval graphs in polynomial time},
author = {Xingfu Li and Haodi Feng and Haotao Jiang and Binhai Zhu},
year = {2018},
doi = {10.1016/j.tcs.2017.09.017},
url = {https://doi.org/10.1016/j.tcs.2017.09.017},
researchr = {https://researchr.org/publication/LiFJZ18},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {734},
pages = {32-37},
}