| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428394 | Information Processing Letters | 2007 | 4 Pages |
Abstract
This study provides the following fast and simple algorithms for an interval graph: (1) an algorithm for counting the number of vertex covers, and (2) an algorithm for counting the number of minimal vertex covers.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
