Traversing Layered Graphs Using the Work Function Algorithm

DOI10.1006/JAGM.1996.0024MaRDI QIDQ4881405zbMATH OpenOpenAlexFDO

Authors W. R. Burley

Publication date 9 June 1996

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1996.0024

zbMATH Keywords

work function algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Competitive Algorithms for Layered Graph Traversal
• Deriving a class of layer-oriented graph algorithms
• scientific article; zbMATH DE number 437566
• On Traversing Layered Graphs On-Line
• Layered graphs: applications and algorithms
• scientific article; zbMATH DE number 1210362
• A generalization of the directed graph layering problem
• A recursive method to compute the layers of a stratified graph
• scientific article; zbMATH DE number 3920516
• On the parameterized complexity of layered graph drawing

Cited in

(13)

• Nested convex bodies are chaseable
• On list update and work function algorithms.
• Better Bounds for Online Line Chasing
• On Traversing Layered Graphs On-Line
• scientific article; zbMATH DE number 437566 (Why is no real title available?)
• Parametrized Metrical Task Systems
• Competitive Algorithms for Layered Graph Traversal
• Randomized algorithms for metrical task systems
• Randomized algorithms for metrical task systems
• Metrical service systems with multiple servers
• The 3-server problem in the plane.
• The K-server problem via a modern optimization lens
• scientific article; zbMATH DE number 1210362 (Why is no real title available?)

This page was built for publication: Traversing Layered Graphs Using the Work Function Algorithm

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