Applications
The partition of a graph into its level structure may be used as a heuristic for graph layout problems such as graph bandwidth. The Cuthill–McKee algorithm is a refinement of this idea, based on an additional sorting step within each level.
Level structures are also used in algorithms for sparse matrices, and for constructing separators of planar graphs.
Read more about this topic: Level Structure
Related Phrases
Related Words