I/O-Efficient Algorithms for Topological Sort and Related Problems
From MaRDI portal
Publication:5236310
DOI10.1137/1.9781611975482.124zbMath1432.68561OpenAlexW4232449624MaRDI QIDQ5236310
Jeremy T. Fineman, Eugene K. Yang, Nairen Cao, Katina Russell
Publication date: 15 October 2019
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611975482.124
Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)
This page was built for publication: I/O-Efficient Algorithms for Topological Sort and Related Problems