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

DOI10.1016/J.IPL.2003.07.005zbMath1178.68659OpenAlexW4245009066MaRDI 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 algorithmsspace complexityDAGincremental updatingtopological sorting

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

A dynamic topological sort algorithm for directed acyclic graphs ⋮ Topological ordering algorithm for LDAG

Uses Software

• LEDA

Cites Work

• Solving systems of difference constraints incrementally
• On competitive on-line algorithms for the dynamic priority-ordering problem
• Unnamed Item

This page was built for publication: Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs