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

DOI10.1016/0020-0190(94)00080-8zbMath0942.68646OpenAlexW1988846076MaRDI QIDQ1332747

G. Ramalingam, Thomas W. 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

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

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 ⋮ Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs ⋮ An algorithm for online topological ordering

Uses Software

• VisiCalc

Cites Work

• On incremental evaluation of ordered attributed grammars
• On the computational complexity of dynamic graph problems
• Bounded incremental computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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