arXiv Open Access 2022

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

Azzam Habib

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DS

Penulis (1)

Azzam Habib

Format Sitasi

APA MLA BibTeX

Habib, A. (2022). Performance evaluation of approximation algorithms for the minimum size 2-vertex strongly connected subgraph problem. https://arxiv.org/abs/2210.09844

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2022
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓