Depth-First Discovery Algorithm for incremental topological sorting of directed acyclic graphs

Information Processing Letters

Volumn 88, Issue 4, 2003, Pages 195-200

  Zhou, Jianjun ^a   Müller, Martin ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

DAG; Graph algorithms; Incremental updating; Space complexity; Topological sorting

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; TOPOLOGY;

ACYCLIC GRAPHS;

DATA PROCESSING;

EID: 0142118456     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2003.07.005     Document Type: Article

References (6)

1. Alpern B., Hoover R., Rosen B., Sweeney P., Zadeck F.D. Incremental evaluation of computational circuits. Proc. 1st Annual ACM-SIAM Symp. on Discrete Algorithms. 1990;32-42.
2. R. Hoover, Incremental graph evaluation, Technical Report 87-836 (PhD Thesis), Dept. of Computer Science, Cornell University, Ithaca, NY, May 1987.
3. Mehlhorn K., Näher S. LEDA: a platform for combinatorial and geometric computing. Comm. ACM. 38:1995;96-102.
4. Melancon G., Herman I. DAG drawing from an information visualization perspective. Proc. of the Joint Eurographics and IEEE TCVG Symposium on Visualization. 2000;. also available online http://www.cwi.nl/InfoVisu.
5. Ramalingam G., Song J., Joskowicz L., Miller R.E. Solving systems of difference constraints incrementally. Algorithmica. 23:1999;261-275.
6. Ramalingam G., Reps T. On competitive on-line algorithms for the dynamic priority-ordering problem. Inform. Process. Lett. 51:(3):1994;155-161.