A linear time algorithm for the minimum weighted feedback vertex set on diamonds
type: Item
instance of: scholarly article
title: A linear time algorithm for the minimum weighted feedback vertex set on diamonds
zbMATH Open document ID: 1182.68145
published in: Information Processing Letters
publication date: 2009-12-04T00:00:00Z
full work available at URL: sdarticle(1).pdf
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5642315
zbMATH Keywords: graph algorithms
zbMATH Keywords: weighted feedback vertex set
zbMATH Keywords: dynamic programming
zbMATH Keywords: diamond
author: Francesco Carrabs
author: Raffaele Cerulli
author: Monica Gentili
author: Gennaro Parlato
MaRDI profile type: Publication
OpenAlex ID: W2062338515
cites work: Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs
cites work: Introduction to algorithms
cites work: Q4198056
cites work: On the feedback vertex set problem in permutation graphs
cites work: A linear-time algorithm for the weighted feedback vertex problem on interval graphs
cites work: Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs
DOI: 10.1016/J.IPL.2004.12.008
description: scientific article; zbMATH DE number 5642315