The following publications are possibly variants of this publication:
- A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval GraphsXingfu Li, Haodi Feng, Haitao Jiang, Binhai Zhu. faw 2016: 92-101 [doi]
- Graph-DTP: Graph-Based Algorithm for Solving Disjunctive Temporal ProblemsYuechang Liu, Hong Qian, Yunfei Jiang. time 2007: 190 [doi]
- A 43-approximation algorithm for the Maximum Internal Spanning Tree ProblemXingfu Li, Daming Zhu, Lusheng Wang. jcss, 118:131-140, 2021. [doi]
- Incremental algorithms for the maximum internal spanning tree problemXianbin Zhu, Wenjun Li, Yongjie Yang 0001, Jianxin Wang 0001. chinaf, 64(5), 2021. [doi]