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 条

[11] ENUMERATION OF ALL MINIMAL CUT-SETS FOR A NODE PAIR IN A GRAPH
ARUNKUMAR, S
LEE, SH
IEEE TRANSACTIONS ON RELIABILITY, 1979, 28 (01) : 51 - 55
[12] Small Edge Sets Meeting all Triangles of a Graph
Lakshmanan, S. Aparna
Bujtas, Cs.
Tuza, Zs.
GRAPHS AND COMBINATORICS, 2012, 28 (03) : 381 - 392
[13] Optimal Segmentation of Directed Graph and the Minimum Number of Feedback Arcs
Xu, Yi-Zhi
Zhou, Hai-Jun
JOURNAL OF STATISTICAL PHYSICS, 2017, 169 (01) : 187 - 202
[14] Optimal Segmentation of Directed Graph and the Minimum Number of Feedback Arcs
Yi-Zhi Xu
Hai-Jun Zhou
Journal of Statistical Physics, 2017, 169 : 187 - 202
[15] On computing the minimum feedback vertex set of a directed graph by contraction operations
Lin, HM
Jou, JY
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2000, 19 (03) : 295 - 307
[16] Search algorithm for computing minimum feedback vertex set of a directed graph
School of Computer, Wuhan University, Wuhan 430072, China
Jisuanji Gongcheng, 2006, 4 (67-69):
[17] ENUMERATION OF ALL CUTSETS OF A GRAPH
RAO, VVB
SANKARAN, P
RAO, KS
MURTI, VGK
PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1968, 56 (07): : 1247 - &
[18] ENUMERATION OF ALL CUTSETS OF A GRAPH
RAO, KS
RAO, VVB
SANKARAN, P
MURTI, VGK
ELECTRONICS LETTERS, 1969, 5 (10) : 208 - &
[19] ENUMERATION OF ALL TREES OF A GRAPH
RAO, VVB
MURTI, VGK
ELECTRONICS LETTERS, 1969, 5 (13) : 282 - &
[20] ENUMERATION OF ALL CIRCUITS OF A GRAPH
RAO, VVB
MURTI, VGK
PROCEEDINGS OF THE IEEE, 1969, 57 (04) : 700 - +

← 1 2 3 4 5 →