An ${\cal O}(n^{2.75})$ Algorithm for Online Topological Ordering

DOI10.1007/11785293_8zbMath1142.05364OpenAlexW2060607751MaRDI QIDQ5757899

Tobias Friedrich, Deepak Ajwani, 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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

A dynamic topological sort algorithm for directed acyclic graphs ⋮ Average-Case Analysis of Online Topological Ordering ⋮ A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering ⋮ Average-case analysis of incremental topological ordering ⋮ An algorithm for online topological ordering

This page was built for publication: An ${\cal O}(n^{2.75})$ Algorithm for Online Topological Ordering