Definition: A connected graph where "layers" L0 ... Lk partition the vertices. Each edge, which has a nonnegative integral weight, connects only vertices in successive layers. The width is the greatest number of vertices in any layer, i.e., MAXi=0k |Li|.
Generalization (I am a kind of ...)
Specialization (... is a kind of me.)
Note: A bipartite graph is a layered graph with two layers.
A. Fiat, D.P. Foster, H.J. Karloff, Y. Rabani, Y. Ravid, and S. Vishwanathan. Competitive Algorithms for Layered Graph Traversal. SIAM J. Comput., to appear. Preliminary version appeared in FOCS '91. Contributed by Giovanni Fiaschi <Giovanni.Fiaschi@marconi.com> June 2000.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 11 April 2005.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Paul E. Black, "layered graph", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 11 April 2005. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/layeredgraph.html