An experimental study of algorithms for obtaining a singly connected subgraph

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 different algorithms to find a feasible but necessarily optimal solution to the following problem. Given a directed acyclic gra...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Zahloote, Ahmed, Saleh, Al-hasan, Ghanem, Ayman, Hasan, Hiba, Dreibaty, Asem, Abodaraa, Ali, Suleiman, Nermeen, Naameh, Nour, Ibrahim, Ali, mahfoud, Zeinab
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Data Structures and Algorithms
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!