Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs

DOI10.1016/j.ipl.2003.07.005zbMath1178.68659MaRDI QIDQ1029013

J. Blot

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.07.005

zbMATH Keywords

graph algorithms; space complexity; DAG; incremental updating; topological sorting

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

Uses Software

• LEDA