Topological ordering algorithm for LDAG

DOI10.1016/j.ipl.2012.07.015zbMath1248.68391OpenAlexW2054356934MaRDI QIDQ456140

Guiping Wang, Zhen Zhou, Xiao-Qin Zhang, Shu-Yu Chen

Publication date: 23 October 2012

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

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

zbMATH Keywords

computational complexitytopological orderDAGlevelLDAG

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• On-demand minimum cost benchmarking for intermediate dataset storage in scientific cloud workflow systems
• Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs
• A structured program to generate all topological sorting arrangements
• An O ( n ^2.75 ) algorithm for incremental topological ordering
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Topological ordering algorithm for LDAG