Online topological ordering

DOI10.1145/1159892.1159896zbMath1321.68515OpenAlexW2104685510WikidataQ59567810 ScholiaQ59567810MaRDI QIDQ2944521

Irit Katriel, Hans L. Bodlaender

Publication date: 2 September 2015

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1159892.1159896

zbMATH Keywords

treewidthonline algorithmsgraphsdynamic algorithmstopological order

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Online algorithms; streaming algorithms (68W27)

Related Items (4)

Average-Case Analysis of Online Topological Ordering ⋮ Topological sorts on DAGs ⋮ A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering ⋮ Average-case analysis of incremental topological ordering

This page was built for publication: Online topological ordering