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

TL;DR

This paper implements and tests approximation algorithms for finding the smallest 2-vertex strongly biconnected subgraph in directed graphs, demonstrating their practical effectiveness through experimental results.

Contribution

It provides practical implementation and empirical evaluation of existing approximation algorithms for the minimum 2-vertex strongly biconnected subgraph problem.

Findings

Algorithms perform well in practice

Implementation confirms theoretical efficiency

Experimental results support algorithm applicability

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.