Abstract: A simple linear algorithm is designed for the minimum connected dominating set problem of interval graphs. The time and space complexity of the algorithm is analyzed, and the feasibility and effectiveness of the algorithm are verified by cases and theory. The results show that the algorithm is linear, that is, a minimum connected dominating set found on the interval graph in O (m+n) time.