An experimental study of algorithms for obtaining a singly connected subgraph

Ahmed Zahloote, Al-hasan Saleh, Ayman Ghanem +7

A directed graph G = (V,E) is singly connected if for any two vertices v, u of V, the directed graph G contains at most one simple path from v to u. In this paper, we study differe…