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 条
  • [41] Edge-colored directed subgraph enumeration on the connectome
    Brian Matejek
    Donglai Wei
    Tianyi Chen
    Charalampos E. Tsourakakis
    Michael Mitzenmacher
    Hanspeter Pfister
    Scientific Reports, 12
  • [42] THE MINIMUM EDGE COVERING ENERGY OF A GRAPH
    Sabeti, Samira
    Dehkordi, Akram Banihashemi
    Semnani, Saeed Mohammadian
    KRAGUJEVAC JOURNAL OF MATHEMATICS, 2021, 45 (06): : 969 - 975
  • [43] Edge-colored directed subgraph enumeration on the connectome
    Matejek, Brian
    Wei, Donglai
    Chen, Tianyi
    Tsourakakis, Charalampos E.
    Mitzenmacher, Michael
    Pfister, Hanspeter
    SCIENTIFIC REPORTS, 2022, 12 (01)
  • [44] Feedback edge sets in temporal graphs
    Haag, Roman
    Molter, Hendrik
    Niedermeier, Rolf
    Renken, Malte
    DISCRETE APPLIED MATHEMATICS, 2022, 307 : 65 - 78
  • [45] FINDING ALL POSSIBLE DIRECTED TREES OF A DIRECTED GRAPH
    SHINODA, S
    ELECTRONICS & COMMUNICATIONS IN JAPAN, 1968, 51 (07): : 45 - &
  • [46] RECONFIGURING MINIMUM DOMINATING SETS: THE γ-GRAPH OF A TREE
    Edwards, Michelle
    MacGillivray, Gary
    Nasserasr, Shahla
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (03) : 703 - 716
  • [47] On minimum rank and zero forcing sets of a graph
    Huang, Liang-Hao
    Chang, Gerard J.
    Yeh, Hong-Gwa
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2010, 432 (11) : 2961 - 2973
  • [48] Graphs such that All Minimum Dominating Sets Intersect All Maximally Independent Sets
    Johnson, P. D., Jr.
    Prier, D. R.
    UTILITAS MATHEMATICA, 2012, 89 : 211 - 224
  • [49] An Simple Enumeration of All Minimal Cutsets of an All-Terminal Graph
    Zhang Hongfen(Shijiazhuang Postal College
    The Journal of China Universities of Posts and Telecommunications, 1995, (02) : 78 - 80
  • [50] Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration
    Couturier, Jean-Francois
    Heggernes, Pinar
    van't Hof, Pim
    Kratsch, Dieter
    SOFSEM 2012: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2012, 7147 : 202 - +
12345