Refined memorization for vertex cover
type: Item
instance of: scholarly article
title: Refined memorization for vertex cover
zbMATH Open document ID: 1173.68529
author: L. Sunil Chandran
author: Fabrizio Grandoni
published in: Information Processing Letters
publication date: 2009-08-27T00:00:00Z
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5599195
zbMATH Keywords: memorization
zbMATH Keywords: vertex cover
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.ipl.2004.10.003
OpenAlex ID: W1976697697
cites work: An improved fixed-parameter algorithm for vertex cover
cites work: Nondeterminism within $P^ * $
cites work: Vertex cover: Further observations and further improvements
cites work: Fixed-parameter tractability and completeness II: On completeness for W[1]
cites work: Q4393480
cites work: Q4263467
cites work: Q3219752
cites work: Q4251072
cites work: A general method to speed up fixed-parameter-tractable algorithms
cites work: On efficient fixed-parameter algorithms for weighted vertex cover
cites work: Algorithms for maximum independent sets
DOI: 10.1016/J.IPL.2004.10.003
description: scientific article; zbMATH DE number 5599195