On Traversing Layered Graphs On-Line

DOI10.1006/JAGM.1995.1019MaRDI QIDQ4837544zbMATH OpenOpenAlexFDO

Authors H. Ramesh

Publication date 18 March 1996

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

randomized on-line algorithms

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 437566
• scientific article; zbMATH DE number 1256772
• Competitive Algorithms for Layered Graph Traversal
• scientific article; zbMATH DE number 1003270
• Traversing Layered Graphs Using the Work Function Algorithm

Cited in

(8)

• Metrical service systems with multiple servers
• Traversing Layered Graphs Using the Work Function Algorithm
• scientific article; zbMATH DE number 437566 (Why is no real title available?)
• Online Graph Exploration: New Results on Old and New Algorithms
• Online graph exploration on trees, unicyclic graphs and cactus graphs
• Online graph exploration: New results on old and new algorithms
• Random walks on weighted graphs and applications to on-line algorithms
• Better Bounds for Online Line Chasing

This page was built for publication: On Traversing Layered Graphs On-Line

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