See this document in CiteSeerX!

A dynamic algorithm for topologically sorting  (Make Corrections)  
directed acyclic graphs David J. Pearce and Paul H. J. Kelly Department of...



  Home/Search   Context   Related

 
View or download:
wwwhomes.doc.ic.ac...TopoSortWEA2004.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  wwwhomes.doc.ic.ac.uk/~phjk/Pu... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. (Update)

Active bibliography (related documents):   More   All
0.8:   Online Algorithms for Topological Order and Strongly Connected.. - Pearce (2003)   (Correct)
0.8:   A Dynamic Algorithm for Topologically Sorting Directed Acyclic .. - Pearce, Kelly (2004)   (Correct)
0.1:   An Experimental Study of Dynamic Algorithms for.. - Frigioni, Miller.. (2000)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ graphs-dynamic,
  author = "Directed Acyclic Graphs",
  title = "A dynamic algorithm for topologically sorting",
  url = "citeseer.ist.psu.edu/763303.html" }
Citations (may not include all citations):
3972   Introduction to Algorithms (context) - Cormen, Leiserson et al. - 2001
49   Incremental evaluation of computational circuits (context) - Alpern, Hoover et al. - 1990
18   Fully dynamic transitive closure: breaking through the O - Demetrescu, Italiano
7   Maintaining shortest paths in digraphs with arbitrary arc we.. - Demetrescu, Frigioni et al. - 2000
3   Improved algorithms for maintaining transitive closure and a.. - Baswana, Hariharan et al. - 2002
3   Lower And Upper Bounds For Incremental Algorithms - Berman - 1992

Documents on the same site (http://wwwhomes.doc.ic.ac.uk/~phjk/Publications/):   More
Locality and False Sharing in Coherent-Cache Parallel Graph.. - Bennett, Kelly (1993)   (Correct)
Parallel Programming Using Skeleton Functions - Darlington, Field, Harrison.. (1993)   (Correct)
Improving the Performance of Morton Layout by Array - Alignment And Loop   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC