Competitive algorithms for layered graph traversal

A layered graph is a connected, weighted graph whose vertices are partitioned into sets L/sub 0/=(s), L/sub 1/, L/sub 2/, . . ., and whose edges run between consecutive layers. Its width is max( mod L/sub i/ mod ). In the online layered graph traversal problem, a searcher starts at s in a layered gr...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Fiat, A., Foster, D.P., Karloff, H., Rabani, Y., Ravid, Y., Viswanathan, S.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithm design and analysis Computer science Costs Length measurement Mathematics Partitioning algorithms Shortest path problem Vents
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!