
Minimum 2vertex strongly biconnected spanning directed subgraph problem
A directed graph G=(V,E) is strongly biconnected if G is strongly connec...
read it

2blocks in strongly biconnected directed graphs
A directed graph G=(V,E) is called strongly biconnected if G is strongly...
read it

barticulation points and bbridges in strongly biconnected directed graphs
A directed graph G=(V,E) is called strongly biconnected if G is strongly...
read it

Minimum 2vertextwinless connected spanning subgraph problem
Given a 2vertextwinless connected directed graph G=(V,E), the minimum ...
read it

2edgetwinless blocks
Let G=(V,E)) be a directed graph. A 2edgetwinless block in G is a maxi...
read it

Computing 2twinless blocks
Let G=(V,E)) be a directed graph. A 2twinless block in G is a maximal v...
read it

Twinless articulation points and some related problems
Let G=(V,E) be a twinless strongly connected graph. a vertex v∈ V is a t...
read it
Raed Jaberi
is this you? claim profile