Fast and simple algorithms to count the number of vertex covers in an interval graph

Authors:
Min-Sheng Lin
Affiliations:
Department of Electrical Engineering, National Taipei University of Technology, 1, Sec. 3, Chung-Hsiao E. Rd., Taipei 106, Taiwan, ROC
Venue:
Information Processing Letters
Year:
2007

Citing 1
Cited 3

Linear-time counting algorithms for independent sets in chordal graphs

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

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

Information Processing Letters
Counting the number of vertex covers in a trapezoid graph

Information Processing Letters
The p-maxian problem on interval graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.89

Visualization

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.