scientific article; zbMATH DE number 437566

MaRDI QIDQ3140445zbMATH OpenFDO

Authors H. Ramesh

Publication date 15 December 1993

zbMATH Keywords

competitive ratiosgraph traversallayered graphon-line algorithms

Mathematics Subject Classification ID

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

Recommendations

• On Traversing Layered Graphs On-Line
• Competitive Algorithms for Layered Graph Traversal
• scientific article; zbMATH DE number 1256772
• Traversing Layered Graphs Using the Work Function Algorithm
• Random walks on weighted graphs and applications to on-line algorithms

Cited in

(10)

• 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
• Competitive Algorithms for Layered Graph Traversal
• On Traversing Layered Graphs On-Line
• Traversing Layered Graphs Using the Work Function Algorithm
• Parametrized Metrical Task Systems
• Collective tree exploration via potential function method
• Shortest paths without a map, but with an entropic regularizer

This page was built for publication:

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