z-logo
open-access-imgOpen Access
I/O-Efficient Algorithms for Topological Sort and Related Problems
Author(s) -
Nairen Cao,
Jeremy T. Fineman,
Katina Russell,
Eugene Yang
Publication year - 2019
Publication title -
society for industrial and applied mathematics ebooks
Language(s) - English
Resource type - Book series
DOI - 10.1137/1.9781611975482.124
Subject(s) - directed acyclic graph , topological sorting , sort , sorting , computer science , sorting algorithm , reachability , directed graph , algorithm , combinatorics , vertex (graph theory) , graph , discrete mathematics , theoretical computer science , mathematics , information retrieval

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom