论文标题
最小尺寸2-Vertex的近似算法的性能评估强烈连接的子图问题
Performance evaluation of approximation algorithms for the minimum size 2-vertex strongly connected subgraph problem
论文作者
论文摘要
Jaberi [7]提出了计算最小尺寸2-vertex的问题的近似算法，在有向图中强烈双连接子图。我们已经实现了[7]中介绍的近似算法，并在某些图上测试了实现。实验结果表明，这些算法在实践中效果很好。
Jaberi [7] presented approximation algorithms for the problem of computing a minimum size 2-vertex strongly biconnected subgraph in directed graphs. We have implemented approximation algorithms presented in [7] and we have tested the implementation on some graphs. The experimental results show that these algorithms work well in practice.
