Performance evaluation of approximation algorithms for the minimum size 2-vertex strongly connected subgraph problem

Abstract

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.