Counting the number of vertex covers in a trapezoid graph
type: Item
instance of: scholarly article
title: Counting the number of vertex covers in a trapezoid graph
zbMATH Open document ID: 1197.05073
author: Min-Sheng Lin
author: Yung-Jui Chen
published in: Information Processing Letters
publication date: 2010-09-01T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5777513
zbMATH Keywords: trapezoid graph
zbMATH Keywords: vertex cover
zbMATH Keywords: combinatorial problems
zbMATH Keywords: counting problems
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.08.003
OpenAlex ID: W2076516201
cites work: Chaining algorithms for multiple genome comparison
cites work: An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs
cites work: Q3797233
cites work: A note on the size of minimal covers
cites work: Trapezoid graphs and their coloring
cites work: Optimal sequential and parallel algorithms to compute all cut vertices on trapezoid graphs
cites work: Q4142699
cites work: Fast and simple algorithms to count the number of vertex covers in an interval graph
cites work: Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph
cites work: On efficient fixed-parameter algorithms for weighted vertex cover
cites work: Counting the number of independent sets in chordal graphs
cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
cites work: Efficient algorithms for the minimum connected domination on trapezoid graphs
cites work: The Complexity of Enumeration and Reliability Problems
DOI: 10.1016/J.IPL.2009.08.003
description: scientific article; zbMATH DE number 5777513