A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds

被引：8
|
作者：
Carrabs, F [1 ]
Cerulli, R
Gentili, A
Parlato, G
机构：
[1] Univ Salerno, Dipartimento Matemat & Informat, I-84084 Fisciano, SA, Italy
[2] Univ Salerno, Dipartimento Informat & Applicaz, I-84081 Baronissi, Italy
来源：
INFORMATION PROCESSING LETTERS | 2005年 / 94卷 / 01期
关键词：
graph algorithms; Weighted Feedback Vertex Set; dynamic programming; diamond;
D O I：
10.1016/j.ipl.2004.12.008
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Given an undirected and vertex weighted graph G, the Weighted Feedback Vertex Problem (WFVP) consists in finding a subset F subset of V of vertices of minimum weight such that each cycle in G contains at least one vertex in F. The WFVP on general graphs is known to be NP-hard. In this paper we introduce a new class of graphs, namely the diamond graphs, and give a linear time algorithm to solve WFVP on it. (c) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码：29 / 35
页数：7
相关论文
共 50 条
  • [1] A Memetic Algorithm for the Weighted Feedback Vertex Set Problem
    Carrabs, Francesco
    Cerrone, Carmine
    Cerulli, Raffaele
    NETWORKS, 2014, 64 (04) : 339 - 356
  • [2] A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs
    Zhang S.-Q.
    Li G.-J.
    Li S.-G.
    Acta Mathematicae Applicatae Sinica, 2004, 20 (4) : 579 - 588
  • [3] A linear-time algorithm for the weighted feedback vertex problem on interval graphs
    Lu, CL
    Tang, CY
    INFORMATION PROCESSING LETTERS, 1997, 61 (02) : 107 - 111
  • [4] An Algorithm for Minimum Feedback Vertex Set Problem on a Trapezoid Graph
    Honma, Hirotoshi
    Kitamura, Yutaro
    Masuyama, Shigeru
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2011, E94A (06) : 1381 - 1385
  • [5] Search algorithm for computing minimum feedback vertex set of a directed graph
    School of Computer, Wuhan University, Wuhan 430072, China
    Jisuanji Gongcheng, 2006, 4 (67-69):
  • [6] A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem
    Carrabs, Francesco
    Cerulli, Raffaele
    Gentili, Monica
    Parlato, Gennaro
    NETWORK OPTIMIZATION, 2011, 6701 : 589 - 602
  • [7] Linear Time Parameterized Algorithms for Subset Feedback Vertex Set
    Lokshtanov, Daniel
    Ramanujan, M. S.
    Saurabh, Saket
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2015, 9134 : 935 - 946
  • [8] Linear Time Parameterized Algorithms for SUBSET FEEDBACK VERTEX SET
    Lokshtanov, Daniel
    Ramanujan, M. S.
    Saurabh, Saket
    ACM TRANSACTIONS ON ALGORITHMS, 2018, 14 (01)
  • [9] Minimum feedback vertex set and acyclic coloring
    Fertin, G
    Godard, E
    Raspaud, A
    INFORMATION PROCESSING LETTERS, 2002, 84 (03) : 131 - 139
  • [10] Fixed parameter enumeration algorithm for feedback vertex set in weighted undirected graphs
    Wang J.-X.
    Jiang G.-H.
    Chen J.-E.
    Jisuanji Xuebao/Chinese Journal of Computers, 2010, 33 (07): : 1140 - 1152
12345