| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428765 | Information Processing Letters | 2008 | 8 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
