Competitive algorithms for layered graph traversal (1991) [25 citations — 2 self]
Download:
|
|
by Amos Fiat, Dean P. Foster, Howard Karloff, Yuval Rabani, Siam J. Comput C
Proc. 31st IEEE Symposium on Foundations of Computer Science
http://epubs.siam.org/sam-bin/getfile/SICOMP/articles/27994.ps.Z
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Fiat91competitivealgorithms,author = {Amos Fiat and Dean P. Foster and Howard Karloff and Yuval Rabani and Siam J. Comput C},
title = {Competitive algorithms for layered graph traversal},
booktitle = {Proc. 31st IEEE Symposium on Foundations of Computer Science},
year = {1991},
pages = {288--297}
}
Years of Citing Articles
Abstract:
Abstract. A layered graph is a connected graph whose vertices are partitioned into sets L 0 =
