ALGORITHM FOR FINDING A MINIMAL EQUIVALENT GRAPH OF A STRONGLY CONNECTED DIGRAPH

被引：4

作者：

MARTELLO, S

机构：

[1] Istituto di Automatica, University of Bologna, Bologna, I-40136, Viale Risorgimento

来源：

COMPUTING | 1979年 / 21卷 / 03期

关键词：

D O I：

10.1007/BF02253052

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The paper presents a new branch and bound algorithm for removing the maximum number of edges from a strongly connected digraph without affecting its reachability properties. A FORTRAN IV implementation is given. The efficiency of the algorithm is analyzed through computational comparison with the methods of Moyles-Thompson and Hsu. © 1979 Springer-Verlag.

引用

页码：183 / 194

页数：12