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
关键词
D O I
10.1016/0196-6774(88)90022-3
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:299 / 313
页数:15
相关论文
共 50 条
  • [41] A PROGRAM FOR SIGNAL FLOW-GRAPHS (AN ALTERNATIVE TO MASON THEOREM)
    MIDGLEY, D
    RICHARDSON, MD
    COMPEL-THE INTERNATIONAL JOURNAL FOR COMPUTATION AND MATHEMATICS IN ELECTRICAL AND ELECTRONIC ENGINEERING, 1985, 4 (03) : 155 - 165
  • [42] SIGNAL FLOW-GRAPHS FOR SPATIAL GEAR TRAINS
    MA, R
    GUPTA, KC
    JOURNAL OF MECHANICAL DESIGN, 1994, 116 (01) : 326 - 331
  • [43] Monte-Carlo randomized algorithm for minimum feedback arc set
    Kudelic, Robert
    APPLIED SOFT COMPUTING, 2016, 41 : 235 - 246
  • [44] The minimum feedback arc set problem is NP-hard for tournaments
    Charbit, Pierre
    Thomasse, Stephan
    Yeo, Anders
    COMBINATORICS PROBABILITY & COMPUTING, 2007, 16 (01): : 1 - 4
  • [45] A classification of tournaments having an acyclic tournament as a minimum feedback arc set
    Isaak, G
    Narayan, DA
    INFORMATION PROCESSING LETTERS, 2004, 92 (03) : 107 - 111
  • [46] Ant inspired Monte Carlo algorithm for minimum feedback arc set
    Kudelic, Robert
    Ivkovic, Nikola
    EXPERT SYSTEMS WITH APPLICATIONS, 2019, 122 : 108 - 117
  • [47] FEEDBACK VERTEX SETS AND CYCLICALLY REDUCIBLE GRAPHS
    WANG, CC
    LLOYD, EL
    SOFFA, ML
    JOURNAL OF THE ACM, 1985, 32 (02) : 296 - 313
  • [48] ALGORITHMS FOR DEFINING MIXED RADIX FFT FLOW-GRAPHS
    DEMUTH, GL
    IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1989, 37 (09): : 1349 - 1358
  • [49] SCHEDULING ALGORITHMS FOR HIERARCHICAL DATA CONTROL FLOW-GRAPHS
    POTKONJAK, M
    RABAEY, JM
    INTERNATIONAL JOURNAL OF CIRCUIT THEORY AND APPLICATIONS, 1992, 20 (03) : 217 - 233
  • [50] Modelling of Multiple, Semantically-Coupled Flow-Graphs
    Jorewitz, R.
    Quiros, G.
    Epple, U.
    IEEE/SOLI'2008: PROCEEDINGS OF 2008 IEEE INTERNATIONAL CONFERENCE ON SERVICE OPERATIONS AND LOGISTICS, AND INFORMATICS, VOLS 1 AND 2, 2008, : 965 - 971