Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph
type: Item
instance of: scholarly article
title: Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph
zbMATH Open document ID: 1185.05138
author: Min-Sheng Lin
author: Yung-Jui Chen
published in: Information Processing Letters
publication date: 2010-04-19T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5694991
zbMATH Keywords: algorithms
zbMATH Keywords: combinatorial problems
zbMATH Keywords: counting problems
zbMATH Keywords: interval graphs
zbMATH Keywords: minimum vertex covers
zbMATH Keywords: maximum minimal vertex covers
MaRDI profile type: Publication
full work available at URL: j.ipl.2008.03.008
OpenAlex ID: W1981341188
cites work: Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
cites work: Fast and simple algorithms to count the number of vertex covers in an interval graph
cites work: Graph-Theoretic Concepts in Computer Science
cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
cites work: A unified approach to domination problems on interval graphs
cites work: The Complexity of Enumeration and Reliability Problems
DOI: 10.1016/J.IPL.2008.03.008
description: scientific article; zbMATH DE number 5694991