(definition)

**Definition:**
A *connected graph* where "layers" L_{0} … L_{k} *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., MAX_{i=0}^{k} |L_{i}|.

**Generalization** (I am a kind of ...)

*connected graph*.

**Specialization** (... is a kind of me.)

*bipartite graph*.

*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.*

Author: PEB

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 11 April 2005.

HTML page formatted Wed Mar 13 12:42:46 2019.

Cite this as:

Paul E. Black, "layered graph", in
*Dictionary of Algorithms and Data Structures* [online], Paul E. Black, ed. 11 April 2005. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/layeredgraph.html