On Traversing Layered Graphs On-Line

DOI10.1006/JAGM.1995.1019zbMATH Open0834.68092OpenAlexW4252986459MaRDI QIDQ4837544FDOQ4837544

Authors: H. Ramesh 

Publication date: 18 March 1996

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

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

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

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)

Cited In (8)

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

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)