ENUMERATION OF ALL MINIMUM FEEDBACK EDGE SETS IN A DIRECTED GRAPH

被引：1
|
作者：
SRIMANI, PK
机构：
来源：
INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE | 1980年 / 11卷 / 02期
关键词：
D O I：
10.1080/00207728008967010
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：239 / 246
页数：8
相关论文
共 50 条
  • [1] MINIMUM FEEDBACK ARC SETS FOR A DIRECTED GRAPH
    YOUNGER, DH
    [J]. IEEE TRANSACTIONS ON CIRCUIT THEORY, 1963, CT10 (02): : 238 - &
  • [2] MINIMUM FEEDBACK ARC AND VERTEX SETS OF A DIRECTED GRAPH
    LEMPEL, A
    CEDERBAUM, I
    [J]. IEEE TRANSACTIONS ON CIRCUIT THEORY, 1966, CT13 (04): : 399 - +
  • [3] NEW ALGORITHM TO DETERMINE ALL THE MINIMUM EDGE SETS OF A SYSTEM GRAPH.
    Srimani, Pradip K.
    Sinha, Bhabani P.
    Choudhury, Arun K.
    [J]. 1978, 24 (12): : 534 - 539
  • [4] Faster enumeration of all spanning trees of a directed graph
    Hariharan, R
    Kapoor, S
    Kumar, V
    [J]. ALGORITHMS AND DATA STRUCTURES, 1995, 955 : 428 - 439
  • [5] Approximating minimum feedback sets and multicuts in directed graphs
    Even, G
    Naor, J
    Schieber, B
    Sudan, M
    [J]. ALGORITHMICA, 1998, 20 (02) : 151 - 174
  • [6] Approximating Minimum Feedback Sets and Multicuts in Directed Graphs
    G. Even
    J. (Seffi) Naor
    B. Schieber
    M. Sudan
    [J]. Algorithmica, 1998, 20 : 151 - 174
  • [7] Fast enumeration of all independent sets of a graph up to isomorphism
    Myrvold, Wendy
    Fowler, Patrick W.
    [J]. Journal of Combinatorial Mathematics and Combinatorial Computing, 2013, 85 : 173 - 194
  • [8] ON MINIMUM FEEDBACK ARC SET OF A DIRECTED GRAPH.
    Wong, Yin Wah
    Chang, Shi Kuo
    [J]. International Journal on Policy and Information, 1980, 4 (02): : 1 - 20
  • [9] THE MINIMUM AUGMENTATION OF A DIRECTED TREE TO A K-EDGE-CONNECTED DIRECTED GRAPH
    KAJITANI, Y
    UENO, S
    [J]. NETWORKS, 1986, 16 (02) : 181 - 197
  • [10] Small Edge Sets Meeting all Triangles of a Graph
    S. Aparna Lakshmanan
    Cs. Bujtás
    Zs. Tuza
    [J]. Graphs and Combinatorics, 2012, 28 : 381 - 392
12345