Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph

Min-Sheng Lin, Yung-Jui Chen. Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph. Inf. Process. Lett., 107(6):257-264, 2008. [doi]

Abstract

Abstract is missing.