A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering
From MaRDI portal
Publication:2465638
Recommendations
Cites work
- scientific article; zbMATH DE number 432748 (Why is no real title available?)
- scientific article; zbMATH DE number 1947389 (Why is no real title available?)
- A dynamic topological sort algorithm for directed acyclic graphs
- An ${\cal O}(n^{2.75})$ Algorithm for Online Topological Ordering
- Fibonacci heaps and their uses in improved network optimization algorithms
- Maintaining a topological order under edge insertions
- On competitive on-line algorithms for the dynamic priority-ordering problem
- Online topological ordering
Cited in
(5)
This page was built for publication: A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465638)