A topological sorting algorithm for large graphs

DOI10.1145/2133803.2330083MaRDI QIDQ5406271zbMATH OpenOpenAlexFDO

Authors Deepak Ajwani, Adan Cosgaya-Lozano, Norbert Zeh

Publication date 1 April 2014

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2133803.2330083

zbMATH Keywords

external-memory algorithmsgraph algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Engineering a Topological Sorting Algorithm for Massive Graphs
• I/O-efficient algorithms for topological sort and related problems
• Algorithm Theory - SWAT 2004
• A dynamic topological sort algorithm for directed acyclic graphs
• An O ( n ^2.75 ) algorithm for incremental topological ordering

Cited in

(5)

• Engineering a Topological Sorting Algorithm for Massive Graphs
• I/O-efficient algorithms for topological sort and related problems
• I/O-Efficient Algorithms for Topological Sort and Related Problems
• Virtual network function reconfiguration in 5G networks: an optimization perspective
• On the complexity of topological sorting

This page was built for publication: A topological sorting algorithm for large graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5406271)