Sciweavers

SODA
1993
ACM
85views Algorithms» more  SODA 1993»
14 years 1 months ago
On Traversing Layered Graphs On-line
The following bounds on the competitive ratios of deterministic and randomized on-line algorithms for traversing width-w layered graphs are obtained.
H. Ramesh