Performance evaluation of approximation algorithms for the minimum size 2-vertex strongly connected subgraph problem
Data Structures and Algorithms
2022-10-19 v1
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.
Keywords
Cite
@article{arxiv.2210.09844,
title = {Performance evaluation of approximation algorithms for the minimum size 2-vertex strongly connected subgraph problem},
author = {Azzam Habib},
journal= {arXiv preprint arXiv:2210.09844},
year = {2022}
}
Comments
4 pages