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

This paper presents efficient algorithms for an interval graph. These are (1) an algorithm for counting the number of minimum vertex covers, and (2) an algorithm for counting the number of maximum minimal vertex covers.