Feedback vertex set in hypercubes

被引：55
|
作者：
Focardi, R [1 ]
Luccio, FL
Peleg, D
机构：
[1] Univ Ca Foscari, Dipartimento Informat, Venice, Italy
[2] Univ Trieste, Dipartimento Sci Matemat, Trieste, Italy
[3] Weizmann Inst Sci, Dept Comp Sci & Appl Math, IL-76100 Rehovot, Israel
来源：
INFORMATION PROCESSING LETTERS | 2000年 / 76卷 / 1-2期
关键词：
feedback vertex set; cycle; hypercube; codes; combinatorial problems;
D O I：
10.1016/S0020-0190(00)00127-7
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Given a graph G = (V, E), the minimum feedback vertex set (V) over bar is a subset of vertices of minimum size whose removal induces an acyclic subgraph G' = (V \ (V) over bar, E'). The problem of finding (V) over bar is NP-hard for general networks but interesting polynomial solutions have been found for particular graph classes. In this paper we find close upper and lower bounds to the size of (V) over bar in a k-dimensional hypercube. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：1 / 5
页数：5
相关论文
共 50 条
  • [21] Feedback vertex set on AT-free graphs
    Kratsch, Dieter
    Mueller, Haiko
    Todinca, Ioan
    [J]. DISCRETE APPLIED MATHEMATICS, 2008, 156 (10) : 1936 - 1947
  • [22] Feedback vertex set reconfiguration in planar graphs
    Bousquet, Nicolas
    Hommelsheim, Felix
    Kobayashi, Yusuke
    Muehlenthaler, Moritz
    Suzuki, Akira
    [J]. THEORETICAL COMPUTER SCIENCE, 2023, 979
  • [23] An Approximate Kernel for Connected Feedback Vertex Set
    Ramanujan, M. S.
    [J]. 27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019), 2019, 144
  • [24] ON THE FEEDBACK VERTEX SET PROBLEM IN PERMUTATION GRAPHS
    LIANG, YD
    [J]. INFORMATION PROCESSING LETTERS, 1994, 52 (03) : 123 - 129
  • [25] Algorithms for the Independent Feedback Vertex Set Problem
    Tamura, Yuma
    Ito, Takehiro
    Zhou, Xiao
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2015, E98A (06): : 1179 - 1188
  • [26] Improved algorithms for feedback vertex set problems
    Chen, Jianer
    Fomin, Fedor V.
    Liu, Yang
    Lu, Songjian
    Villanger, Yngve
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2008, 74 (07) : 1188 - 1198
  • [27] On feedback vertex set in reducible flow hypergraphs
    Faria, Luerbio
    Guedes, Andre L. P.
    Markenzon, Lilian
    [J]. PROCEEDINGS OF THE XI LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, 2021, 195 : 212 - 220
  • [28] Minimum feedback vertex set and acyclic coloring
    Fertin, G
    Godard, E
    Raspaud, A
    [J]. INFORMATION PROCESSING LETTERS, 2002, 84 (03) : 131 - 139
  • [29] FPT Algorithms for Connected Feedback Vertex Set
    Misra, Neeldhara
    Philip, Geevarghese
    Raman, Venkatesh
    Saurabh, Saket
    Sikdar, Somnath
    [J]. WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2010, 5942 : 269 - 280
  • [30] Simultaneous Feedback Vertex Set: A Parameterized Perspective
    Agrawal, Akanksha
    Lokshtanov, Daniel
    Mouawad, Amer E.
    Saurabh, Saket
    [J]. ACM TRANSACTIONS ON COMPUTATION THEORY, 2018, 10 (04)
12345