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 条
  • [21] An effective algorithm for minimum weighted vertex cover problem
    Balaji, S.
    Swaminathan, V.
    Kannan, K.
    World Academy of Science, Engineering and Technology, 2010, 43 : 315 - 319
  • [22] An effective algorithm for minimum weighted vertex cover problem
    Balaji, S.
    Swaminathan, V.
    Kannan, K.
    World Academy of Science, Engineering and Technology, 2010, 67 : 315 - 319
  • [23] A PARALLEL ALGORITHM FOR THE MINIMUM WEIGHTED VERTEX COVER PROBLEM
    LIKAS, A
    STAFYLOPATIS, A
    INFORMATION PROCESSING LETTERS, 1995, 53 (04) : 229 - 234
  • [24] A polynomial algorithm for finding the minimum feedback vertex set of a 3-regular simple graph
    Li, DM
    Liu, YP
    ACTA MATHEMATICA SCIENTIA, 1999, 19 (04) : 375 - 381
  • [25] New Algorithm for Finding Minimum Vertex Cut Set
    Ugurlu, Onur
    Berberler, Murat Ersen
    Kizilates, Goezde
    Kurt, Mehmet
    2012 IV INTERNATIONAL CONFERENCE PROBLEMS OF CYBERNETICS AND INFORMATICS (PCI), 2012,
  • [26] Almost exact minimum feedback vertex set in meshes and butterflies
    Luccio, FL
    INFORMATION PROCESSING LETTERS, 1998, 66 (02) : 59 - 64
  • [27] Engineering a PTAS for Minimum Feedback Vertex Set in Planar Graphs
    Borradaile, Glencora
    Le, Hung
    Zheng, Baigong
    ANALYSIS OF EXPERIMENTAL ALGORITHMS, SEA2 2019, 2019, 11544 : 98 - 113
  • [28] On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms
    Fedor V. Fomin
    Serge Gaspers
    Artem V. Pyatkin
    Igor Razgon
    Algorithmica, 2008, 52 : 293 - 307
  • [29] On the minimum feedback vertex set problem: Exact and enumeration algorithms
    Fomin, Fedor V.
    Gaspers, Serge
    Pyatkin, Artem V.
    Razgon, Igor
    ALGORITHMICA, 2008, 52 (02) : 293 - 307
  • [30] A Hybrid Immunological Search for the Weighted Feedback Vertex Set Problem
    Cutello, Vincenco
    Oliva, Maria
    Pavone, Mario
    Scollo, Rocco A.
    LEARNING AND INTELLIGENT OPTIMIZATION, LION, 2020, 11968 : 1 - 16
12345