See Also
- Boxicity, a different way of measuring the complexity of an arbitrary graph in terms of interval graphs
- Tree-depth, a number that is bounded for a minor-closed graph family if and only if the family excludes a path
- Degeneracy, a measure of the sparsity of a graph that is at most equal to its path width
- Graph bandwidth, a different NP-complete optimization problem involving linear layouts of graphs
- Strahler number, a measure of the complexity of rooted trees defined similarly to pathwidth of unrooted trees
Read more about this topic: Path Decomposition
Famous quotes containing the word see:
“For the gods, though slow to see, see well, whenever a man casting aside worship turns folly.”
—Sophocles (497–406/5 B.C.)