A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs

@inproceedings{Pearce2004ADA,
  title={A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs},
  author={David J. Pearce and Paul H. J. Kelly},
  booktitle={WEA},
  year={2004}
}
We consider how to maintain 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 marginally inferior time complexity compared with the best previously known result, we find that its simplicity leads to better performance in practice. In addition, we provide an empirical comparison against three alternatives over a large number of random DAG’s. The results show our algorithm is the best for… CONTINUE READING
Highly Cited
This paper has 39 citations. REVIEW CITATIONS

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…