Average-Case Analysis of Online Topological Ordering
From MaRDI portal
(Redirected from Publication:5387779)
Recommendations
- Average-case analysis of incremental topological ordering
- An ${\cal O}(n^{2.75})$ Algorithm for Online Topological Ordering
- An O ( n 2.75 ) algorithm for incremental topological ordering
- An algorithm for online topological ordering
- A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering
Cites work
- A dynamic topological sort algorithm for directed acyclic graphs
- A fully dynamic reachability algorithm for directed graphs with an almost linear update time
- A phase transition phenomenon in a random directed acyclic graph
- A uniform approach to semi-dynamic problems on digraphs
- Algorithms – ESA 2004
- An ${\cal O}(n^{2.75})$ Algorithm for Online Topological Ordering
- scientific article; zbMATH DE number 432748 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 1305092 (Why is no real title available?)
- Incremental algorithms for minimal length paths
- Maintaining a topological order under edge insertions
- On competitive on-line algorithms for the dynamic priority-ordering problem
- On the computational complexity of dynamic graph problems
- On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph
- Online topological ordering
- Online topological ordering
- Random graphs.
This page was built for publication: Average-Case Analysis of Online Topological Ordering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387779)
