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

Authors:
Min-Sheng Lin;Yung-Jui Chen
Affiliations:
Department of Electrical Engineering, National Taipei University of Technology, 1, Sec. 3, Chung-Hsiao E. Rd., Taipei 106, Taiwan, ROC;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:
2008

Citing 4
Cited 2

A unified approach to domination problems on interval graphs

Information Processing Letters
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs

SIAM Journal on Computing
Fast and simple algorithms to count the number of vertex covers in an interval graph

Information Processing Letters
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

Counting the number of vertex covers in a trapezoid graph

Information Processing Letters
Dominating set counting in graph classes

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	0.89

Visualization

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.