An {\cal O}(n^{2.75}) Algorithm for Online Topological Ordering
From MaRDI portal
Publication:5757899
DOI10.1007/11785293_8zbMATH Open1142.05364OpenAlexW2060607751MaRDI QIDQ5757899FDOQ5757899
Authors: Deepak Ajwani, Tobias Friedrich, Ulrich Meyer 
Publication date: 7 September 2007
Published in: Algorithm Theory – SWAT 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11785293_8
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)
Cited In (10)
- Maintaining a topological order under edge insertions
- A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering
- An O ( n 2.75 ) algorithm for incremental topological ordering
- An algorithm for online topological ordering
- Average-case analysis of incremental topological ordering
- On-line sorting of twisted sequences in linear time
- A new approach to incremental topological ordering
- A dynamic topological sort algorithm for directed acyclic graphs
- Online topological ordering
- Average-Case Analysis of Online Topological Ordering
This page was built for publication: An ${\cal O}(n^{2.75})$ Algorithm for Online Topological Ordering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757899)
