๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Competitive Algorithms for Layered Graph Traversal

โœ Scribed by Fiat, Amos; Foster, Dean P.; Karloff, Howard; Rabani, Yuval; Ravid, Yiftach; Vishwanathan, Sundar

Book ID
118178159
Publisher
Society for Industrial and Applied Mathematics
Year
1998
Tongue
English
Weight
382 KB
Volume
28
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Algorithms and Data Structures || Graph
Algorithms and Data Structures || Graph Traversal
โœ , ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ German โš– 295 KB

Algorithms are at the heart of every nontrivial computer application, and algorithmics is a modern and active area of computer science. Every computer scientist and every professional programmer should know about the basic algorithmic toolbox: structures that allow efficient organization and retriev

Traversing Layered Graphs Using the Work
Traversing Layered Graphs Using the Work Function Algorithm
โœ William R. Burley ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 299 KB

The work function algorithm WFA is an on-line algorithm that has been studied mostly in connection with the k-server problem, but can actually be used on a wide variety of on-line problems. Despite being a simple algorithm, WFA has proven to be difficult to analyze, and until recently few interestin