Counting the number of vertex covers in a trapezoid 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:
2009

Citing 10
Cited 3

Trapezoid graphs and their coloring

Discrete Applied Mathematics
Effincient Domination of Permutation Graphs and Trapezoid Graphs

COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
On efficient fixed-parameter algorithms for weighted vertex cover

Journal of Algorithms
Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs

Computational Optimization and Applications
A note on the size of minimal covers

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

Information Processing Letters
Efficient algorithms for the minimum connected domination on trapezoid graphs

Information Sciences: an International Journal
Counting the number of independent sets in chordal graphs

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

Information Processing Letters
Fundamentals of Data Structures in C

Fundamentals of Data Structures in C

Closest pair and the post office problem for stochastic points

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Efficient algorithm for the vertex connectivity of trapezoid graphs

Information Processing Letters
Closest pair and the post office problem for stochastic points

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.89

Visualization

Abstract

This work presents simple and efficient algorithms for a trapezoid graph. They are (1) an algorithm for counting the number of vertex covers, (2) an algorithm for counting the number of minimal vertex covers, and (3) an algorithm for counting the number of minimum vertex covers and maximum minimal vertex covers simultaneously. All the proposed algorithms have a time complexity of O(n^2), where n is the number of vertices in the trapezoid graph.