D. J. Pearce and P. H. J. Kelly. A dynamic algorithm for topologically sorting directed acyclic graphs. In Proc. of the 3rd Int. Worksh. E#cient and Experimental Algorithms (WEA 2004), Lecture Notes in Computer Science. Springer-Verlag, 2004. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Tree Decompositions With Small Cost - Irit Katriel Hans (2005) (2 citations) (Correct)
No context found.
D. J. Pearce and P. H. J. Kelly. A dynamic algorithm for topologically sorting directed acyclic graphs. In Proc. of the 3rd Int. Worksh. E#cient and Experimental Algorithms (WEA 2004), Lecture Notes in Computer Science. Springer-Verlag, 2004.
Online Topological Ordering - Katriel, Bodlaender (Correct)
No context found.
D. J. Pearce and P. H. J. Kelly. A dynamic algorithm for topologically sorting directed acyclic graphs. In Proc. of the 3rd Int. Worksh. Ecient and Experimental Algorithms (WEA 2004), Lecture Notes in Computer Science. Springer-Verlag, 2004.
Online Topological Ordering - Irit Katriel And (Correct)
No context found.
David J. Pearce and Paul H. J. Kelly. A dynamic algorithm for topologically sorting directed acyclic graphs. In Proc. 3rd Int. Worksh. Ecient and Experimental Algorithms (WEA 2004), Lecture Notes in Computer Science. Springer-Verlag, 2004.
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