On competitive on-line algorithms for the dynamic priority-ordering problem

DOI10.1016/0020-0190(94)00080-8MaRDI QIDQ1332747zbMATH OpenOpenAlexFDO

Authors G. Ramalingam, Thomas Reps

Publication date 14 August 2000

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(94)00080-8

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• Bounded incremental computation
• scientific article; zbMATH DE number 1638664 (Why is no real title available?)
• scientific article; zbMATH DE number 432748 (Why is no real title available?)
• scientific article; zbMATH DE number 3976291 (Why is no real title available?)
• scientific article; zbMATH DE number 53049 (Why is no real title available?)
• scientific article; zbMATH DE number 194259 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• On incremental evaluation of ordered attributed grammars
• On the computational complexity of dynamic graph problems

Cited in

(5)

• Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs
• A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering
• An algorithm for online topological ordering
• A dynamic topological sort algorithm for directed acyclic graphs
• Average-Case Analysis of Online Topological Ordering

Describes a project that uses

Uses Software

• VisiCalc

This page was built for publication: On competitive on-line algorithms for the dynamic priority-ordering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1332747)