A dynamic topological sort algorithm for directed acyclic graphs

We consider the problem of maintaining the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, although this has inferior time complexity compared with the best previously known result, we find that its simplicity lead...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	The ACM journal of experimental algorithmics 2007-02, Vol.11
Hauptverfasser:	Pearce, David J., Kelly, Paul H. J.
Format:	Artikel
Sprache:	eng
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!