FINDING A MINIMUM FEEDBACK ARC SET IN REDUCIBLE FLOW-GRAPHS

被引：30
|
作者：
RAMACHANDRAN, V
机构：
[1] MATH SCI RES INST,BERKELEY,CA
[2] UNIV ILLINOIS,URBANA,IL 61801
来源：
JOURNAL OF ALGORITHMS | 1988年 / 9卷 / 03期
关键词：
D O I：
10.1016/0196-6774(88)90022-3
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：299 / 313
页数：15
相关论文
共 50 条
  • [21] The minimum feedback vertex set for kronecker product of graphs
    Tigrine, Fouad
    Kheddouci, Hamamache
    UTILITAS MATHEMATICA, 2007, 74 : 207 - 237
  • [22] An efficient algorithm for finding maximum cycle packings in reducible flow graphs
    Chen, XJ
    Zang, W
    ALGORITHMS AND COMPUTATION, 2004, 3341 : 306 - 317
  • [23] An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs
    Xujin Chen
    Wenan Zang
    Algorithmica, 2006, 44 : 195 - 211
  • [24] An efficient algorithm for finding maximum cycle packings in reducible flow graphs
    Chen, XJ
    Zang, WN
    ALGORITHMICA, 2006, 44 (03) : 195 - 211
  • [25] OPTIMAL CODE FROM FLOW-GRAPHS
    RAMANATH, MVS
    SOLOMON, M
    COMPUTER LANGUAGES, 1982, 7 (01): : 41 - 52
  • [26] Exact algorithms for finding the minimum independent dominating set in graphs
    Liu, Chunmei
    Song, Yinglei
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2006, 4288 : 439 - +
  • [27] An iterated greedy algorithm for finding the minimum dominating set in graphs
    Casado, A.
    Bermudo, S.
    Lopez-Sanchez, A. D.
    Sanchez-Oro, J.
    MATHEMATICS AND COMPUTERS IN SIMULATION, 2023, 207 : 41 - 58
  • [28] PATH ENUMERATION USING FLOW-GRAPHS
    RAI, S
    AGGARWAL, KK
    MICROELECTRONICS AND RELIABILITY, 1979, 19 (04): : 391 - 393
  • [29] SIGNAL FLOW-GRAPHS AND NEURAL NETWORKS
    OSOWSKI, S
    BIOLOGICAL CYBERNETICS, 1994, 70 (04) : 387 - 395
  • [30] MINIMUM FEEDBACK ARC SETS IN ROTATOR AND INCOMPLETE ROTATOR GRAPHS
    Kuo, Chi-Jung
    Hsu, Chiun-Chieh
    Lin, Hon-Ren
    Chen, Da-Ren
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2012, 23 (04) : 931 - 940
12345