Competitive Algorithms for Layered Graph Traversal
Work
Year: 1998
Type: article
Abstract: A layered graph is a connected graph whose vertices are partitioned into sets L0=s, L1, L2,..., and whose edges, which have nonnegative integral weights, run between consecutive layers. Its width is $... more
Source: SIAM Journal on Computing
Cites: 17
Cited by: 24
Related to: 10
FWCI: 0.517
Citation percentile (by year/subfield): 89.84
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green