Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

SODA
1993
ACM

favoriteEmaildiscussreport

85views Algorithms» more SODA 1993»

On Traversing Layered Graphs On-line

13 years 6 months ago

On Traversing Layered Graphs On-line

Download hariharan-ramesh.com

The following bounds on the competitive ratios of deterministic and randomized on-line algorithms for traversing width-w layered graphs are obtained.

H. Ramesh

Real-time Traffic

Algorithms | Competitive Ratios | On-line Algorithms | SODA 1993 | Width-w Layered Graphs |

claim paper

Related Content

» Layered Graph Traversals and Hamiltonian Path Problems An Algebraic Approach

» Competitive Algorithms for Layered Graph Traversal

» Performance analysis of parallel programs via messagepassing graph traversal

» Viewing WISs as Database Applications

Post Info
More Details (n/a)

Added	02 Nov 2010
Updated	02 Nov 2010
Type	Conference
Year	1993
Where	SODA
Authors	H. Ramesh

Comments (0)