Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022
Identifying a 3-vertex strongly biconnected directed subgraph with minimum number of edges
Azzam Habib
A strongly connected graph is strongly biconnected if after ignoring the direction of its edges we have an undirected graph with no articulation points. A 3-vertex strongly biconne…
cs.DS2022
Performance evaluation of approximation algorithms for the minimum size 2-vertex strongly connected subgraph problem
Azzam Habib
Jaberi [7] presented approximation algorithms for the problem of computing a minimum size 2-vertex strongly biconnected subgraph in directed graphs. We have implemented approximati…